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())
string = input()

string_len = len(string)
words = []

if string_len < k:
	print("NO")
elif k == 1:
	print("YES")
	print(string)
else:
	first_char = string[0]
	last_index = 0
	for i in range(1,string_len):
		if len(words) == k-1:
			words.append(string[i-1:])
			break
		if string[i] == first_char:
			continue
		else:
			flag = True
			for word in words:
				if word.startswith(string[i]):
					flag = False
					break
			if flag:
				words.append(string[last_index:i])
				last_index = i
				first_char = string[i]
			else:
				continue
	if len(words) == k:
		print("YES")
		for i in range(k):
			print(words[i])
	else:
		print("NO")