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.
x=int(input())
y=input()
p=set()
b=[]
for l in y:
    p.add(l)
    b.append(l)
if len(p)>=x:
    print("YES")
    c=[]
    v=[]
    for l in b:
        if l not in c:
            c.append(l)
    i=0
    while i<x:
        v.append(b.index(c[i]))
        i+=1
    v.append(len(b))
    j=0
    t=[]
    s=""
    while j<x:
        for h in range(int(v[j]),int(v[j+1])):
            s+=b[h]
        t.append(s)
        s=""
        j+=1
    print(" ".join(t))
else:
    print("NO")
