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())
s=input()
F=[0]*26
arr=[]
i=0
while i<len(s):
	if not F[ord(s[i])-ord('a')]:
		tem=s[i]
		F[ord(s[i])-ord('a')]=1
		i+=1
		while i<len(s) and F[ord(s[i])-ord('a')]:
			tem=tem+s[i]
			i+=1
		arr.append(tem)
if len(arr)<n:
	print("NO")
else:
	print("YES")
	while len(arr)!=n:
		ss=arr[-1]
		arr.pop(-1)
		ss=arr[-1]+ss
		arr.pop(-1)
		arr.append(ss)
	print(*arr,sep="\n")
		 		   				 	 	  	 		 	 						