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())
s = input()
d = set()
n = len(s)
i = 0
l = []
for _ in range(k + 1):
    res = ""
    while(i < n):
        if(s[i] in d):
            res += s[i]
        else:
            d.add(s[i])
            l.append(res)
            break
        i += 1
l = l[1:]
l[-1] += s[i:]
if(len(l) < k):
    print ("NO")
else:
    print ("YES")
    for i in l:
        print (i)
