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()
a = {}
l = []
i = 0
while i < len(s):
	f = True
	for j in range(len(l)):
		if l[j][0] == s[i]:
			f=False
			break
	if f == True:
		l.append(s[i])
	else:
		l[-1] = l[-1]+s[i]
	i+=1
if len(l)< n:
	print('NO')
else:
	print('YES')
	for i in range(n,len(l)):
		l[n-1]+=l[i]
	for i in range(n):
		print(l[i])
