You are given a string q. A sequence of k strings s1, s2, ..., sk is called beautiful, if the concatenation of these strings is string q (formally, s1 + s2 + ... + sk = 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.

Input

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.

Output

If such sequence doesn't exist, then print in a single line "NO" (without the quotes). Otherwise, print in the first line "YES" (without the quotes) and in the next k lines print the beautiful sequence of strings s1, s2, ..., sk.

If there are multiple possible answers, print any of them.

Examples

Input

1
abca


Output

YES
abca


Input

2
aaacas


Output

YES
aaa
cas


Input

4
abc


Output

NO

Note

In the second sample there are two possible answers: {"aaaca", "s"} and {"aaa", "cas"}.
"""
A. Set of Strings
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given a string q. 
A sequence of k strings s1,s2,...,sk is called beautiful,
 if the concatenation of these strings is string q (formally, s1+s2+...+sk=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.

Input
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.

Output
If such sequence doesn't exist, 
then print in a single line "NO" 
(without the quotes). Otherwise, print in the first line 
"YES" (without the quotes) and in the next k lines print 
the beautiful sequence of strings s1,s2,...,sk.

If there are multiple possible answers, print any of them.

"""
debug = 0
k = int(raw_input())
a = raw_input()

if k>len(a):
	print "NO"
	exit()

list1 = [a[0]]
ans = []
b=0
for i in xrange(1,len(a)):
	if(debug): print "i :", i
	if(k>0):
		if a[i] in list1:
			continue
		else:
			# if(i==len(a)-1 and b==i-1):
			# 	ans.append(a[b:])
			# 	if(debug): print "appended :Bleh", a[b:]
			# 	b=len(a)
			if(k==1):
				ans.append(a[b:])
				if(debug): print "appended to ans:", a[b:]
				b=len(a)-1
			else:
				ans.append(a[b:i])
				if(debug): print "appended to ans:", a[b:i]
				b=i
			if(debug): print "k :", k
			if(debug): print "b :",b
			list1.append(a[b])
			if(debug): print "appended to list1", a[b]	
			k-=1
if(debug): print len(a)
if(b!=len(a) and k>0):
	ans.append(a[b:])
	k -= 1
if(debug):
	print "Printing list1"
	print "len(list1) :", len(list1)
	for i in xrange(len(list1)):
		print list1[i]
if(debug):
	print "Printing ans"
	for i in xrange(len(ans)):
		print ans[i]
if(k>0): print "NO"
else: 
	print "YES"
	for i in xrange(len(ans)):
		print ans[i]