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())
q = input()

if k == 1:
    print("YES")
    print(q)
else:
    s = set(q[0])
    l = []
    p = 0
    for i in range(len(q)):
        if q[i] not in s:
            s.add(q[i])
            l.append((p, i - 1))
            p = i
    l.append((p, len(q) - 1))

    if k > len(l):
        print("NO")
    else:
        print("YES")
        i = 0
        while i < k - 1:
            print(q[l[i][0]:l[i][1] + 1])
            i += 1
        print(q[l[i][0]:])