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.
I=input
P=print
k=int(I())
r=[]
i=0
s=I()
while i<len(s) and k>0:
	j=i+1
	while j<len(s)and any(map(lambda x:x[0]==s[j],[s[i]]+r)):j+=1
	r+=[s[i:j]];k-=1;i=j
if k:P('NO')
else:
	P('YES',end='')
	t=0
	for i in r:P('\n'+i,end='');t+=len(i)
	P(s[t:])