You are given a string q. A sequence of k strings s1, s2, ..., sk is called beautiful, if the concatenation of these strings is string q (formally, s1 + s2 + ... + sk = q) and the first characters of these strings are distinct.

Find any beautiful sequence of strings or determine that the beautiful sequence doesn't exist.

Input

The first line contains a positive integer k (1 ≤ k ≤ 26) — the number of strings that should be in a beautiful sequence. 

The second line contains string q, consisting of lowercase Latin letters. The length of the string is within range from 1 to 100, inclusive.

Output

If such sequence doesn't exist, then print in a single line "NO" (without the quotes). Otherwise, print in the first line "YES" (without the quotes) and in the next k lines print the beautiful sequence of strings s1, s2, ..., sk.

If there are multiple possible answers, print any of them.

Examples

Input

1
abca


Output

YES
abca


Input

2
aaacas


Output

YES
aaa
cas


Input

4
abc


Output

NO

Note

In the second sample there are two possible answers: {"aaaca", "s"} and {"aaa", "cas"}.
'''
Created on 7/05/2015

@author: Miguel
'''
import sys

arch = sys.stdin.read().splitlines()

arrays = []

k = int(arch[0])
q = arch[1]

lenq = len(q)

current = 0

def exist(c):
    flag = False
    for i in arrays:
        if i[0] == c:
            flag = True
    return flag

for i in range(len(q)):
    if len(arrays) == k - 1:
            arrays.append(q[current:len(q)])
            break

    if q[current] != q[i] and not exist(q[i]):
        arrays.append(q[current:i])
        current = i
        if i == len(q) - 1:
            arrays.append(q[current])
            break  
      

if len(arrays) < k:
    print "NO"
else:
    print "YES"
    for i in arrays:
        print i



"""
1
abca
4
abca
"""
