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"}.
k = input();
q = raw_input();
l = len(q);
a = []
lis = []
for i in range(26):
	a.append(0);
if l < k:
	print "NO";
else:
	s = ''
	i = 0
	x = k
	k-=1
	while i < l:
		j = ord(q[i]) - 97
		a[j] = 1
		f = 0
		if k:
			while i < l and a[ord(q[i]) - 97]:
				s += q[i]
				i+=1
				f = 1
			if f == 1:
				lis.append(s)
				s = ''
				k-=1
			else:
				i+=1
		else:
			lis.append(q[i:])
			break
	if x != len(lis):
		print 'NO'
	else:
		print 'YES'
		for i in range(len(lis)):
			print lis[i]			
