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.
n = int(input())
v = input()
a = list()
q = 0
r = 0
if n == 1:
    print("YES")
    print(v)
else:
    for i in range(len(v) - 1):
        if v[i] != v[i + 1]:
            e = v[r : i+1]
            a.append(e)
            q += 1
        if q + 1 == n:
            e1 = v[i+1 : len(v)]
            a.append(e1)
            break
        r = i
    if len(a) < n:
        print("NO")
    else:
        print("YES")
        for i in a:
            print(i)