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())
s = input()
x = k
mylist = []
if k == 1:
    print("YES")
    print(s)
elif k > len(s):
    print("NO")
else:
    init = s[0]
    for i in range(1, len(s)):
        if init != s[i]:
            if k != 0:
                indx = s.index(init)
                if k > 1:
                    mylist.append(s[indx:i])
                else:
                    mylist.append(s[indx:len(s)])
                init = s[i]
                k -= 1
    if len(mylist) == x:
        print("YES")
        for i in range(0, len(mylist)):
            print(mylist[i])
    else:
        print("NO")
        