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()
ss=set(s)
sub=""
if(len(ss)<n):
	print("NO");
else:
	print("YES")
	ss=set([])
	ss.add(s[0])
	n-=1
	for a in s:
		if((a not in ss)  and ( n>0)):
		#	print("dfd")
			ss.add(a)
			print(sub)
			sub=a
			n-=1
		else:
			#print("in else");
			#print(a)
			sub=sub+a
			#print(sub)

print(sub)

