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.
k = int(input())
s = input()
ans = []
cur = ""
used = set()
for i in range(len(s)):
    if s[i] not in used:
        if len(cur) > 0:
            ans.append(cur)
        cur = ""
        cur += s[i]
        used.add(s[i])
    else:
        cur += s[i]
ans.append(cur)
if len(ans) < k:
    print("NO")
else:
    print("YES")
    for i in range(k, len(ans)):
        ans[k - 1] += ans[i]
    for i in range(k):
        print(ans[i])