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())
a = input()
d = {}
count = 0
for i in range(len(a)):
    if d.get(a[i]) == None:
        d[a[i]] = 1
        count += 1
if count >= n:
    print('YES')
    d = {}
    count = 0
    i = 0
    j = 0
    while count < n - 1:
        if d.get(a[i]) == None:
            d[a[i]] = 1
            if a[j:i] != '':
                count += 1 
                print(a[j:i])
                j = i
        i += 1
    print(a[j:])            
else:
    print('NO')