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.
from collections import Counter as co
k=int(input())
s=input()
x,y=divmod(len(s),k)
if y==0:
    c=[s[i] for i in range(0,len(s),x)]
    c=co(c)
    for i in c.values():
        if i>1:
            print('NO')
            break
    else:
        print('YES')
        for i in range(0,len(s)-1,x):
            print(s[i:i+x])
        
    
else:
    print('NO')