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()

a = []

if k == 1:
    print ("YES")
    print (s)


elif k > len(s):
    print ("NO")

else:
    f = 0
    i = 0
    while True:
        if i == len(s)-1:
            break
        if s[i] != s[i+1]:
            a.append(s[:i+1])
            s = s[i+1:]
        if len(a) == k-1:
            f = 1
            break
        i += 1


    if f==0:
        print("NO")
    else:
        print ("YES")
        for i in a:
            print (i)
        
        print (s)