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.
# -----------------------------------------------------------
# URL    : https://codeforces.com/contest/544/problem/A
# Title  : Set of Strings
# Notes  : tag-codeforces, tag-problem-A, tag-div-2
# -----------------------------------------------------------


def solve():
    k = int(input())
    q = input()
    n = len(q)

    if n < k:
        print("NO")
        return

    if k == 1:
        print("YES")
        print(q)
        return

    used_char = [q[0]]
    results = []
    start = 0
    left = k

    for i in range(1, n):
        if q[i] not in used_char:
            results.append(q[start:i])
            start = i
            used_char.append(q[i])
            left -= 1

        if left == 1:
            results.append(q[i:])
            break

    if len(results) == k:
        print("YES")

        for r in results:
            print(r)
    else:
        print("NO")


if __name__ == "__main__":
    solve()
