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.
x = int(input())
l = input()
ln = len(l)
lst = []
lst2 = []
n = 0
z = 0
for i in range(ln):
    if l[i] not in lst:
        lst.append(l[i])
        lst2.append(i)
        n+=1
    if n>=x:
        print('YES')
        z = 1
        break
else:
    print('NO')
if z:
    if x==1:
        print(l)
    else:
        for q in range(1,x):
            print(l[lst2[q-1]:lst2[q]])
        else:
            print(l[lst2[-1]:])