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()
s = [None]*k
if k == 1:
    print("YES")
    print(q)
else:
    first_letters = set([q[0]])
    j = 0
    i = 0
    while True:
        if q[i] not in first_letters:
            first_letters.add(q[i])
            s[j]=q[:i]
            j += 1
            q = q[i:]
            i = 1
            if j + 1 == k:
                s[j] = q
                print('YES')
                print('\n'.join(s))
                break
        else:
            i += 1
        if i == len(q):
            print("NO")
            break

