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.
# Contest: 20 - 2100 <= Codeforces Rating <= 2199 (https://a2oj.com/ladder?ID=20)
# Problem: (12) Laptops (Difficulty: 3) (http://codeforces.com/problemset/problem/456/A)

def rint():
    return int(input())


def rints():
    return list(map(int, input().split()))


k = rint()
q = input()
p = [-1] * 26
for i, c in enumerate(q):
    p[ord(c) - ord('a')] = i
pv = [i for i in p if i >= 0]
if len(pv) < k:
    print('NO')
    exit(0)
pv = sorted(pv)
print('YES')
for i in range(k):
    if i == k - 1:
        print(q[pv[i]:])
    else:
        print(q[pv[i]:pv[i + 1]])
