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"}.
n = int(raw_input())
q = raw_input()

m = len(q)

if n==1:
	print 'YES'
	print q
	exit()
		
if m < n:
	print 'NO'
	exit() 

mark = [0]*26
mark[ord(q[0]) - ord('a')] = 1

s = q[0]
v = []
t = n
for i in range(1,m):
	z = ord(q[i]) - ord('a')
	if not mark[z] and t-1:
		v.append(s)
		mark[z] = 1
		s = q[i]
		t-=1
	else:
		s = s + q[i]	

if len(s):
	v.append(s)		

if len(v) != n:
	print 'NO'
else:
	print 'YES'
	for _ in v:
		print _
