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"}.
n  = input()
x = raw_input()
l=[x[0]]
for i in range(1,len(x)):
    if x[i]==x[i-1]:
        l[-1]+=x[i]
    else:
        l.append(x[i])
# print l
# if len(l)==n:
#   print "YES"
#   for i in l:
#       print i
a=[]
ans=[]
for i in range(len(l)):
    if l[i][0] in a:
        ans[-1]+=l[i]
    else:
        ans.append(l[i])
    a.append(l[i][0])
# print ans

if len(ans)>=n:
    print "YES"
    for i in range(n-1):
        print ans[i]
    print ''.join(ans[n-1:])
else:
    print "NO"