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())
t = input()
s = set()
l = []
v = ""
for i in range(len(t)):
	if t[i] in s:
		continue
	s.add(t[i])
	l.append((t[i],i))
if len(s) >= n:
	print("YES")
	k = 0
	flag = 0
	for i in range(n-1):
		flag = 1
		print(t[l[i][1]:l[i+1][1]])
	if flag == 0:
		print(t[l[0][1]:])
	if flag == 1:
		print(t[l[i+1][1]:])
else:
	print("NO")