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())
t = input()
if n > len(set(t)):
    print('NO')
else:
    pos = [0 for _ in range(len(t)+1)]
    dis = set()
    c = 0
    for i in range(len(t)):
        if t[i] not in dis:
            dis.add(t[i])
            pos[c] = i
            c = c+1
    pos[n] = len(t)
    for i in range(n):
        print(t[pos[i]:pos[i+1]])