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()
k = set()
i = 0
temp = ""
l = []
for _ in range(n):
    try:
        if len(l) + 1 == n:
            l.append(s[i:])
            break
        else:
            temp += s[i]
            i+=1
            while s[i] == temp[0]:
                temp += s[i]
                i+=1
            l.append(temp)
    except:
        print("NO")
        quit()
if l:
    print("YES")
    print(*l,sep='\n')
else:
    print("NO")