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.
# print ("Input k")
k = int(input())
# print ("Input the string")
st = input()
ln = len(st)

if (k==1):
    print ("YES")
    print(st)
elif (k > ln):
    print ("NO")
else:    #  Perhaps possible--build the set and list
    letset = set()
    indexlist = []
    for i in range(ln):
        if (st[i] not in letset):  #  A new letter-process it
            letset.add(st[i])
            indexlist.append(i)

    # Are there enough distinct letters to make it?
    if (len(letset) < k):
        print ("NO")
    else:  # We can do it--print out each piece using the indexlist
        print ("YES")
        for i in range(k-1):    # Must print the last one separately
            print(st[indexlist[i]:indexlist[i+1]])
        print (st[indexlist[k-1]:])
        
    
