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().strip()

def solve(k, q):
    if k == 1:
        return [q]
    used = set()
    ss = []
    s = [q[0]]
    used.add(q[0])
    for i in range(1, len(q)):
        c = q[i]
        if c in used:
            s.append(c)
            continue
        used.add(c)
        ss.append(''.join(s))
        if len(used) == k:
            ss.append(q[i:])
            break
        s = [c]
    else:
        return False
    return ss

ans = solve(k, q)
if ans:
    print('YES')
    for a in ans:
        print(a)
else:
    print('NO')
