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())
q = input()
if n > len(q):
    print("NO")
else:
    if n == 1:
        print("YES")
        print(q)
    else:
        arr = [0]*len(q)
        for x in range(0, len(q)):
            arr[x] = q[x]

        con = arr[0]
        res = ["-1"]*n
        count = 0
        x = 0
        while(count < n-1):
            if arr[x] == arr[x+1]:
                con += arr[x+1]
                x += 1
            else:
                res[count] = con
                con = arr[x+1]
                count +=1
                x += 1

        res[count] = q[3:]
        if res[len(res) - 1] == "-1":
            print("NO")
        else:
            print("YES")
            for x in res:
                print(x)



