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


n = int(input())
s = str(input())
l = []

for i in s:
    if not i in l:
        l.append(i)

vals = []

if len(l) < n:
    print("NO")
    sys.exit(0)
else:
    print("YES")
    for i in range(n):
        vals.append(s.index(l[i]))

for i in range(n):
    if i == n-1:
        print(s[vals[len(vals)-1]:len(s)])
    else:
        print(s[vals[i]:vals[i+1]])
                