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()
a = []
result = []
for i in range(97, 123):
    a.append(chr(i))
for (j, t) in enumerate(q):
    if len(result) == k:
        result[len(result) - 1] += q[j:]
        break
    if t in a:
        a.remove(t)
        result.append(q[j])
    else:
        result[len(result) - 1] += t
if len(result) == k:
    print('YES')
    for row in result:
        print(row)
else:
    print('NO')