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())
s = input()
first_letter = []
lst = []
count = prev = i = 0
l = len(s)
if k==1:
    print('YES')
    print(s)
elif k>l:
    print('NO')
else:
    while i<l:
        first_letter.append(s[i])
        count += 1
        i += 1
        while s[i] in first_letter:
            i += 1
        if count!=k:
            lst.append(s[prev:i])
            prev = i
        else:
            lst.append(s[prev:])
            break
    if len(lst)==k:
        print('YES')
        print('\n'.join(lst))
    else:
        print('NO')

# aaacas 2