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
o = input()

x = int(o)
z = input()
x2 = list()
if o == '1':
    print('YES')
    print(z)
    sys.exit()
else:
    if len(z) % x == 0:
        x2.append('YES')
        x2.append(z[0:int(len(z)/x)])
        x2.append(z[int(len(z)/x)::])
    else:
        x2.append('NO')
for i in x2:
    print(i)