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.
def f(q):
    ans, j = [], 0
    for i in range(len(q) - 1):
        if q [i] != q [i+1]:
            ans.append(q[j:i+1])
            j = i+1
    if q [len(q)-1] != q [len (q)-2]:
        ans.append(q [len (q)-1])
        
k, q, ans = int (input()), input(), f (q)

if len (ans) >= k:
    print ("YES")
    for x in ans:print(ans)
else : print("NO")