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
input = sys.stdin.readline

k = int(input())
s = input()[:-1]
d = []
c = 0
for i in range(len(s)-1):
    if s[i+1] != s[i]:
        k -= 1
        if k == 0:
            d.append(s[i-c:])
            break
        else:
            d.append(s[i-c:i+1])
        c = 0
    else:
        c += 1
if k > 0:
    print("NO")
else:
    print("YES")
    for i in d:
        print(i)