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 = int(raw_input())
s = raw_input()

cnt = []
vis = [False]*26
now = 0
l = len(s)
i = 0
while i < l and now < k:
	index = ord(s[i]) - ord('a')
	if(vis[index] == False):
		cnt.append(i)
		vis[index] = True
		now += 1
	else:
		cnt[now - 1] = i;
	i += 1

if now < k:
	print "NO"
else:
	cnt[now - 1] = l - 1;
	print "YES"
	now = 0
	for i in range(0,k):
		print s[now:cnt[i]+1]
		now = cnt[i]+1
