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.
n=int(input())
s=input()
if n==1:
    print('YES')
    print(s)
    exit()
if len(s)==1:
    print('NO')
    exit()
a=[]
s1=s[0]
set1=[s1]
for i in range(1,len(s)):
    if s[i] in set1:
        s1+=s[i]
    else:
        a.append(s1)
        set1.append(s[i])
        s1=s[i]
a.append(s1)
kol=0
if len(a)<n:
    print('NO')
    exit()
for i in range(len(a)):
    kol+=1
    if kol<n:
        print(a[i])
    else:
        print(a[i],end='')