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.
q = int(input())
s = input()

unique = set()

for c in s:
	unique.add(c)

#print(unique)
if len(unique) < q:
	print("NO")
	exit()
print("YES")

char_to_index = {}
for c in s:
	char_to_index[c] = s.index(c)
#print(char_to_index)


prints = []
for v in char_to_index.values():
	prints.append(v)
#prints.append(len(s))
#print(prints)

for i in range(q):
	if i == q-1:
		print(s[prints[i]:])
	else:
		print(s[prints[i]:prints[i+1]])


