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())
q = input()
l = len(q)
s = set()
s.add(q[0])
pos = [0]
count = 1

i = 1
while (i < l) and (count < k):
    if not (q[i] in s):
        pos.append(i)
        s.add(q[i])
        count += 1
    i += 1
    
if count == k:
    print('YES')
    pos.append(l)
    for i in range(k):
        print(q[pos[i]:pos[i+1]])
else:
    print('NO')