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

i = 0
met = []
ts = []
while i < len(q):
    if q[i] in met:
        i += 1
    else:
        met.append(q[i])
        ts.append(i)
ts.append(len(q))

if len(ts) >= k + 1:
    print('YES')
    for i in range(len(ts) - 1):
        a = ts[i]
        b = ts[i + 1]
        if i == k - 1:
            print(q[a:])
            break
        print(q[a:b])
else:
    print('NO')

