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

answer = []
mapa = {}

x = 'abcdefghijklmnopqrstuvxzyw'

for e in x:
	mapa[e] = 0

if n == 1:
	print "YES"
	print s
elif n > len(s):
	print "NO"
	
else:

	cont = 0
	for i in range(len(s)):
		if mapa[s[i]] == 0:
			cont += 1
			answer.append(i)
			mapa[s[i]] += 1

	if cont >= n:
		print "YES"
		cont = 0
		i = 0
		while i < len(answer)-1:
			cont += 1
			print s[answer[i]:answer[i+1]:]
			i += 1
			if(cont == n-1): break
		print s[answer[i]:len(s):]

	else: print "NO"
