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() 
visited = set() 
indices = [] 
for i in range(len(q)): 
    if q[i] not in visited : indices.append(i) ; visited.add(q[i])
strings = [] 
for i in range(len(indices)-1): 
    if i+1 == k : strings.append(q[indices[i]:]) ; break
    else : strings.append(q[indices[i]:indices[i+1]])
if len(strings) < k : strings.append(q[indices[-1]:])
if len(strings) < k : print("NO")
else : 
    print("YES")
    print(*strings, sep = '\n')