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().strip()
a = set(s)
if len(a) < k:
    print('NO')
    exit()
print('YES')
ans = []
x = 0
use = set()
for i in range(len(s)):
    if k == 1:
        print(s[x:])
        exit()
    if s[i] in use:
        continue
    else:
        use.add(s[i])
        if x != i:
            print(s[x:i])
            k -= 1
        x = i
print(s[x:])