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.
k = input()
word = input()
#print(k)
#print(word)
list = []
for i in word:
    #print (i)
    if i not in list:
        list.append(i)
#print(list)
marker = 0
count = 0
if len(list) < int(k):
    print("NO")
else:
    print("YES")
    for i in range(1,len(word)):
        if word[i:i+1] != word[i-1:i] and count < int(k):
            #print(marker)            
            print(word[marker:i])
            marker = i
            #print(marker)
            count += 1
    if count < int(k):
        print(word[marker:])