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.
# http://codeforces.com/problemset/problem/544/A
def main():
    n = int(input())
    s = str(input())
    if n > len(s):
        print('NO')
        return
    else:
        part = int(len(s) / n)
        initial = 0
        for i in range(0, n):
            print(s[initial:part])
            initial = part
            part += part
        resi = len(s) % n
        if resi > 0:
            print(s[-resi:])

main()