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()
c=s[0]
ind=[]
cnt=0
for i in range(1,len(s)):
    if c!=s[i]:
        cnt+=1
        ind.append(i)
if cnt<n:
    print("NO")
    exit(0)
i=0
j=0
for x in range(n):
    if x+1==n:
        print(s[i:])
    else:
        print(s[i:ind[j]])
        i=ind[j]
        j+=1


