You are given a string *q*. A sequence of *k* strings *s*<sub class="lower-index">1</sub>, *s*<sub class="lower-index">2</sub>, ..., *s*<sub class="lower-index">*k*</sub> is called beautiful, if the concatenation of these strings is string *q* (formally, *s*<sub class="lower-index">1</sub> + *s*<sub class="lower-index">2</sub> + ... + *s*<sub class="lower-index">*k*</sub> = *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.
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.
N = int(input())
S = input()
found = set()
for i in range(len(S)):
	k = S[i]
	if(not k in found):
		found.add(k)

if(len(found)>=N):
	print("YES")
	ptr1 = 0
	count = 0
	for i in range(len(S)):
		if(count==N-1):
			print(S[ptr1:])
			break
		if(i>0 and S[i]!=S[i-1]):
			print(S[ptr1:i])
			ptr1=i
			count+=1
else:
	print("NO")