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())
q=input().strip()
seen=set(q[0])
subs=[]
cur=0
if len(set(q))>=n:
    print("YES")
    for i,j in enumerate(q):
        if j not in seen:
            seen|={j}
            subs+=[q[cur:i]]
            cur=i
            n-=1
        if n<=1:
            subs+=[q[cur:]]
            break
    print("\n".join(subs))
else:
    print("NO")