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.
from itertools import combinations

n = int(input())
q = input()

if n == 1:
    print("YES")
    print(q)
else:
    for l in combinations(range(1, len(q)), n - 1):
        fl = [q[i] for i in l]
        fl.append(q[0])

        if len(fl) == len(set(fl)):
            print("YES")
            sol = []
            sol.append(q[0:l[0]])
            for i in range(1, len(l)):
                sol.append(q[l[i - 1]:l[i]])
            sol.append(q[l[-1]:])
            print("\n".join(sol))
            break
    else:
        print("NO")
