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"}.
from sys import stdin

live = True
if not live: stdin = open('data.in', 'r')

k = int(stdin.readline().strip())
s = stdin.readline().strip()
used = [False] * 26
answer = []
lenght = len(s)

for i in xrange(lenght):
	if not used[ord(s[i]) - 97]:
		used[ord(s[i]) - 97] = True
		answer += [i]
		
if len(answer) < k:
	print 'NO'
else:
	print 'YES'
	for word in xrange(k - 1):
		print s[answer[word] : answer[word + 1]]
	print s[answer[k - 1] : lenght]
		
if not live: stdin.close()