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.
number = int(input())
string = list(input())

lib = []
ans = 0
string_set = []

for i in range(len(string)):
    if not (string[0] in lib):            
        ans += 1
        lib.append(string[0])
        string_set.append(string.pop(0))
    else:
        string_set[-1] += string.pop(0)
        
    if ans == number or len(string) == 0:
        for j in range(len(string)):
            string_set[-1] += string[j]
        break

if ans == number:
    print('YES')
    for i in string_set:
        print(i)
else:
    print('NO')
