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

used = set()
ans = []
t = ''

for c in q:
	if c in used:
		t += c
	else:
		if t:
			ans.append(t)
		t = c
		used.add(c)
ans.append(t)

if len(ans) < k:
	print('NO')
else:
	print('YES')
	ans[k-1] = ''.join(ans[k-1:])
	for s in ans[:k]:
		print(s)
