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.
#!/usr/bin/python3
n=int(input())
s=input()
res=""
dic=set()
num=0
for i,c in enumerate(s):
  if c in dic:
    res+=c
  else:
    res+="\n"
    dic.add(c)
    num+=1
    if num == n:
      res+=s[i:]
      break
    else:
      res+=c
if num!=n:
  print ("NO")
else:
  print ("YES"+res)


     
   

