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())
k2 = k
s = input()
if len(s) < k:
    print("NO")
else:
    res = []
    curr = dups = ""
    for idx, el in enumerate(s):
        if el not in dups:
            dups += el
            if len(curr) > 0:
                k -= 1
                res.append(curr)
            if k == 1:
                res.append(s[idx:])
                break
            curr = el
        else:
            curr += el

    if len(res) != k2:
        print("NO")
    else:
        print("YES")
        [print(el) for el in res]
