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"}.
# print ("Input k")
k = int(input())
# print ("Input the string")
st = input()
ln = len(st)

if (k==1):
    print ("YES")
    print(st)
elif (k > ln):
    print ("NO")
else:    #  Perhaps possible--build the set and list
    letset = set()
    indexlist = []
    for i in range(ln):
        if (st[i] not in letset):  #  A new letter-process it
            letset.add(st[i])
            indexlist.append(i)

    # Are there enough distinct letters to make it?
    if (len(letset) < k):
        print ("NO")
    else:  # We can do it--print out each piece using the indexlist
        print ("YES")
        for i in range(k-1):    # Must print the last one separately
            print(st[indexlist[i]:indexlist[i+1]])
        print (st[indexlist[k-1]:])
        
    
