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())
s = input()
point = 1
ans = str()
used = set(s[0])
last_point = 0
for i in range(n - 1):
    while point <= len(s) and s[point - 1] in used:
        point += 1
    if point <= len(s):
        used.add(s[point - 1])
        ans += s[last_point:point - 1] + '\n'
        last_point = point - 1
    else:
        print('NO')
        break
ans += s[last_point:]
if point <= len(s):
    print('YES')
    print(ans)