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"}.
k=input()
a=raw_input()
ans=[]
sl=len(a)
if k==1:
    print 'YES'
    print a
    exit()
cnt=0
i=0
j=i
first=set()
while i<sl-1:
    first.add(a[i])
    j=i
    while j+1<sl:
        if a[j]==a[j+1] or a[j+1] in first:
            j+=1
        else:
            break  
    ans.append(a[i:j+1])
    cnt+=1 
    i=j+1
if a[j+1:]<>'':
    ans.append(a[j+1:])
if len(ans)<k:
    print 'NO'
else:
    print 'YES'
    for i in range(k-1):
        print ans[i]
    print ''.join(ans[k-1:])