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 = int(input())
sona = input()
letters = set(sona)

if(k == 1):
    print("YES")
    print(sona)
    exit()

if(len(letters) < k):
    print("NO")
    exit()

print("YES")

wordIndexList = []
char = sona[0]
letters.remove(sona[0])

for i in range(len(sona)):
    if(sona[i] == char):
        continue
    if(sona[i] != char and sona[i] in letters):
        #split at i
        wordIndexList.append(i)
        char = sona[i]
        letters.remove(sona[i])

start = 0
for i in range(k):
    if(i != k-1):
        print(sona[start:wordIndexList[i]])
        start = wordIndexList[i]
    else:
        print(sona[start:])
