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()
if k == 1:
    print('YES')
    print(q)
else:
    s, ans, t = set(), [], ''
    for i in q:
        if not(i in s):
            s.add(i)
            ans.append(t)
            t = i
        else:
            t += i
    ans.append(t)
    ans.pop(0)
    if len(ans) >= k:
        print('YES')
        print('\n'.join(ans[i] for i in range(k - 1)))
        print(''.join(ans[i] for i in range(k - 1, len(ans))))
    else:
        print('NO')
        