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.
from collections import OrderedDict
count = int(input())
line  = input()

uniq = "".join(OrderedDict.fromkeys(line).keys())

if count > len(uniq):
	print("NO")
else:
	print("YES")
	if count == len(uniq):
		while len(line) != 0:
			first_uniq = 0
			uniq = uniq[1:]
			if len(uniq) == 0:
				print(line)
				break
			last_uniq = line.find(uniq[0])
			print(line[first_uniq:last_uniq])
			line = line[last_uniq:]
	else:
		while count != 1:
			first_uniq = 0
			uniq = uniq[1:]
			last_uniq = line.find(uniq[0])
			print(line[first_uniq:last_uniq])
			line = line[last_uniq:]
			count -= 1
		print(line)