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.
w, st = int(input()), input()
s = set()
stri = st[0]
s.add(st[0])
lst = []
i = 0
if len(st) < w: print("NO")
for k in range(len(st)):
    if k != 0:
        if st[k] not in s:
            s.add(st[k])
            lst.append(stri)
            stri = st[k]
        else:
            stri += st[k]
lst.append(stri)

if len(lst)>=w:
    print("YES")
    for i in range(w):
        if i == w-1:
            print(str("".join(lst[i:])))
        else:
            print(lst[i])
else:
    print("NO")
            
        
















































