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

#fin = open("input.txt", 'r')
fin = sys.stdin

n = int(fin.readline())
s = fin.readline().strip()
i = 1
cur = 0
used = {c: False for c in "qwertyuiopasdfghjklzxcvbnm"}
starts = [0]
used[s[0]] = True
while i < len(s) and cur < n - 1:
    if not used[s[i]]:
        used[s[i]] = True
        starts.append(i)
        cur += 1
    i += 1
if cur < n - 1:
    print("NO")
else:
    print("YES")
    starts.append(len(s))
    for i in range(len(starts) - 1):
        print(s[starts[i]:starts[i + 1]])
