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())
string = input()
p = 0
if n > len(string):
    print('NO')
elif n == 1:
    print("YES")
    print(string)
else:
    first = [string[0]]
    answer = []
    while n > 1:
        for j in range(len(string)):
            if string[j] not in first:
                answer.append(string[p:j])
                first.append(string[j])
                p = j
                break
        n -= 1
    answer.append(string[p:])
    print('YES')
    for m in range(len(answer)):
        print(answer[m])

					    		  					  	 		 		   	