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())
a = input()
sum = 0
p = []
for i in range(len(a)):
    if a[i] not in p:
        sum += 1
        p.append(a[i])
if sum < k:
    print('NO')
else:
    p = []
    print('YES')
    for i in range(len(a)):
        if k == 0:
            print(a[i], end = '')
        else:
            if a[i] not in p:
                if len(p) != 0:
                    print()
                print(a[i], end = '')
                p.append(a[i])
                k -= 1
            else:
                print(a[i], end = '')
        
