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.
import sys

k = int(input())
s = input()
c = 0
sets = {chr(x) for x in range(ord("a"), ord("z") + 1)}
a = []
if len(s) == 1:
    print("YES")
    print(s)
elif len(s) < k:
    print("NO")
    sys.exit()
else:
    for x in range(len(s)):
        if s[x] in sets:
            c += 1
            sets.remove(s[x])
            a.append(x)
            if c == k:
                print("YES")
                for x in range(len(a) - 1):
                    print(s[a[x]:a[x + 1]])
                print(s[a[-1]:])
