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())


t = input()


f=[]
v=[]


if len(set(list(t)))<n:
    print('NO')
else:


    u=''
    p=0
    h=0
    while p<len(t):
        if t[p] not in f:
            if len(u)>0:
                v.append(u)
                u=''
            f.append(t[p])
            u+=t[p]
        else:
            u+=t[p]
        p+=1

    if len(u)>0:
        v.append(u)



    if len(v)>=n:
        print('YES')
        if n==1:
            print(''.join(v))
        else:
            for j in v[:n-1]+[''.join(v[n-1:])]:
                print(j)
    else:
        print('NO')
        


