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.
import math

if __name__ == '__main__':
    k = int(input())
    s = str(input())
    refer = list()

    lines = list()
    line = str()
    flag = False
    for i in s:
        if i not in refer and k > 1:
            refer.append(i)
            if flag:
                k -= 1
                lines.append(line)
                line = str()
                flag = False
        else:
            flag = True
        line += i
    k -= 1
    lines.append(line)
    if k > 0:
        print('NO')
    else:
        print('YES')
        print('\n'.join(lines))
