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.
# LUOGU_RID: 101582059
k = int(input())
s = input()
c = 0
st = set([s[0]])
for i in range(len(s) - 1):
    if s[i] != s[i + 1] and s[i + 1] not in st:
        c += 1
        st.add(s[i + 1])
if c < k:
    exit(print('NO'))
print('YES')
t = s[0]
c = 1
st = set([s[0]])
for i in range(1, len(s)):
    if c < k and s[i] != s[i - 1] and s[i] not in st:
        print(t)
        c += 1
        t = s[i]
        st.add(s[i])
    else:
        t += s[i]
print(t)