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.
n = int(input())
s = input()
d = {}
for i in range(97,150):
    d[chr(i)]=True

ans = []
c = 0
for i in s:
    if d[i]:
        d[i] = False
        ans.append(i)
    else:
        ans[c]+=i

ans[n-1] = "".join(ans[n-1:])

if ans.__len__() < n:
    print("NO")
else:
    print("YES")
    for i in range(n):
        print(ans[i])



