You are given a string *q*. A sequence of *k* strings *s*<sub class="lower-index">1</sub>, *s*<sub class="lower-index">2</sub>, ..., *s*<sub class="lower-index">*k*</sub> is called beautiful, if the concatenation of these strings is string *q* (formally, *s*<sub class="lower-index">1</sub> + *s*<sub class="lower-index">2</sub> + ... + *s*<sub class="lower-index">*k*</sub> = *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.
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.
"""
Cases:

"""

k=int(input())
s=list(input())
m = {}
n=len(s)
l = []
for i in range(n):
    m[s[i]] = i

if(len(m)>=k):
    print('YES')
    j = 0
    for i in m:
        ind = s.index(i)
        l.append(ind)
    while(j<k-1):
        print(''.join(s[l[j]:l[j+1]]))
        j+=1
    print(''.join(s[l[j]:n]))
else:
	print('NO')
