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.
k = int(input())
q = str(input())

beautiful = []
if len(q) < k:
    print("NO")
else:
    for i in q:
        if len(beautiful)==0:
            beautiful.append(i)
        else:
            for j in beautiful:
                if j[0] == i:
                    beautiful[-1]+=i
                    break
                else:
                    beautiful.append(i)
                    break
                
z = 1
if len(beautiful) >= k:
    print("YES")
    for i in beautiful:
        print(i,end="",sep="")
        if z < k:
            print("",end="\n",sep="")
            z+=1