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