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.
def Tekrar(x,liSt):
    d=0
    for i in liSt :
        if i==x:
            d=1
    return d

#---------- Defined / COMPLETE ---------------#

K=int(input())
q=input()
i=0
Tek=[]
Output=[]
while i<len(q):
    Tek.append(q[i])
    Out=''
    while i<len(q)and Tekrar(q[i],Tek)==1 :
        Out+=q[i]
        i+=1
    i+=-1
    if len(Output)==K-1:
        l=i+1
        while l<len(q):
            Out+=q[l]
            l+=1
        Output.append(Out)
        break
    Output.append(Out)
    i+=1

#---------- Finale / OUTPUT ---------------#

if len(Output)==K:
    print("Yes")
    for i in Output:
        print(i)
else:
    print("No")
    
