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())
s=input()
dic={}
for i in s:
    if i in dic:
        dic[i]=dic[i]+1
    else:
        dic[i]=1
l=list(dic.keys())
output=[]
if len(dic)<n:
    print("NO")
else :
    for j in range(n):
        if j==n-1:
            a=s.find(l[j])
            output.append(s[a:len(s)])
        else:

            a=s.find(l[j])
            b=s.find(l[j+1])
            output.append(s[a:b])
    print("YES")
    for k in range(n):
        print(output[k])
