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.
n=int(input());s=input();k=[];l=[];a=''
for i in range(0,len(s)):
    for j in range(i,len(s)):
        a=''
        a=a+s[j]
    if a[0] not in k and a[len(a)-1] not in k:
        l.append(a)
        k.append(a[0])
        k.append(a[len(a)-1])
if len(l)>=n:
    print('YES')
    for i in range(0,len(l)):
        print(l[i])
else:
    print('NO')