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.
k=int(input())
s=list(input())
#print(''.join(s))
a=[]
for i in range(0,30):
    a.append(1)
sum=0
for x in s:
    sum=sum+a[ord(x)-ord('a')]
    a[ord(x)-ord('a')]=0

if sum>=k:
    print("YES",end='')
    for x in s:
        if a[ord(x)-ord('a')]==0 and k>0:
            k-=1
            print()
            print(x,end='')
        else:
            print(x,end='')
        a[ord(x)-ord('a')]=1
    print()
else:
    print("NO")


    
