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.
a=int(input())
b=input()
c=sorted(list(set(b)))
if len(c)<a:
    print('NO')
else:
    print('YES')
    c.remove(b[0])
    d = c[:a-1]
    e = []
    for i in d:
        e.append(b.index(i))
    e.append(0)
    e.append(len(b))
    e.sort()
    for i in range(len(e)-1):
        print(b[e[i]:e[i+1]])