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())
q = input()

if len(set(q)) < k:
    print('NO')
    exit()

a = set()
cnt = l = r = 0
ans = []
while cnt < k - 1:
    if q[r] not in a:
        a.add(q[r])
        if q[l:r] != '':
            cnt += 1
            ans.append(q[l:r])
            l = r
    r += 1
ans.append(q[l:])

print('YES')
[print(i) for i in ans]