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"}.
import sys
k = input()
s = raw_input()
#print k,s


def print_strs(s,my_list,stri,k):
	count = 0
	index = 0
	for y in s:
		index +=1
		if y in my_list and y != my_list[0] :
			print ""
			count +=1
			my_list.remove(y)
		#int y,
		sys.stdout.write(y)
		if count >= k-1:
			print stri[index:]
			return



stri = s
s = list(s)

my_list = []
count = 0
for x in range(len(s)):
	#print x
	if not s[x] in my_list:
		my_list.append(s[x])
		count +=1
#print "my_list",my_list
if count >= k:
	print "YES"
	print_strs(s,my_list,stri,k)

else:
	print "NO"
