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 sys
k = int(input())
q = input()

if len(set(q)) < k:
    print('NO')
else:
    first = ''
    s = ''
    print('YES')
    for i in range(len(q)):
        if q[i] not in first:
            if len(s) > 0:
                print(s)
                s =''
            s = q[i]
            first += q[i]
            k -= 1
            if k == 0:
                s += q[i+1:len(q)]
                print(s)
                break

        else:
            s += q[i]

