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()
ans_strings = []
starts = []
for i in range(len(q)):
    if q[i] not in starts:
        if k > 1:
            starts.append(q[i])
            ans_strings.append(q[i])
            k -= 1
        elif k == 1:
            ans_strings.append(q[i::])
            k -= 1
            break
    else:
        ans_strings[len(ans_strings) - 1] += q[i]
if k == 0:
    print("YES")
    for i in ans_strings:
        print(i)
else:
    print("NO")