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())
ch=list(input())
don=[0 for x in range(26)]
l=len(ch)
ans=[]
x=0
while x<l:
    s=b=ch[x]
    don[ord(ch[x])-97]=1
    x+=1
    while x<l and (ch[x]==b or don[ord(ch[x])-97]==1):
        s+=ch[x]
        x+=1
    ans.append(s)
if len(ans)<k:
    print("NO")
else:
    s1=""
    v=len(ans)
    z=0
    print("YES")
    for x in range(v-k+1):
        s1+=ans[x]
        z=x
    print(s1)
    z+=1
    for z in range(z,v):
      print(ans[z])