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 len(q) < k:
    print("NO")
else:
    d = []
    i = 0
    s = ''
    while i < len(q) and len(d)+1 < k:
        s += q[i]
        while i+1 < len(q) and q[i] == q[i + 1]:
            i += 1
            s += q[i]
        d.append(s)
        s = ''
        i += 1
    d.append(q[i:])
    if len(d) >= k:
        print("YES")
        print("\n".join(d))
    else:
        print("NO")
