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()
ss=[]
ls=set()
k=0
cur=''
for c in s:
    if k==n:
        cur+=c
    else:
        if c not in ls:
            ls.add(c)
            k+=1
            ss.append(cur)
            cur=c
        else:
            cur+=c
ss.append (cur)
ss=ss [1:]
if k!=n:
    print ('NO')
else:
    print ('YES')
    for st in ss:
        print (st)
