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()
l=[]
j=0
v=1
c=1
T=S[0]
for i in range(1,len(S)) :
    if v==0 and c==1 :
        v=1
        T=S[i]
    else :
        
        if T[0]==S[i] :
            T=T+S[i]
        else :
            j=j+1
            if j<n :
                l.append(T)
                T=S[i]
            else :
                l.append(T+S[i:])
                break
            v=0
            c=0
if n==len(l) :
    print('YES')
    for i in range(len(l)) :
        print(l[i])
else :
    print('NO')
            
