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.
s=int(input())
b=input()
freq=[0]*300
c=0
p=[]
o=[]
x=""
flag=True
for j in b:
    freq[ord(j)]+=1
for k in range(len(freq)):
    if freq[k]>=1:
        c+=1
        p+=[chr(k)]
if c>=s:
    print("YES")
else:
    print("NO")
    flag=False
if flag:
 for k in b:
    if k in p and freq[ord(k)]!=0:
        if x!="":
          o+=[x]
        x=k
        freq[ord(k)]=0
    elif freq[ord(k)]==0:
        x+=k
 else:
    o+=[x]
 for e in range(len(o)):
    if len(o)!=s:
       o[0]+=o[1]
       o.pop(1)
 for m in o:
    print(m)




















