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())
W = input()
first = []
if k > len(W):
    print("NO")
elif k == len(set(W)):
    print("YES")
    for I in W:
        print(I)  
elif k == 1:
    print("YES")
    print(W)
else:
    start = 0
    Next = start + 1
    li = [] 
    while True :
        if Next > len(W):
            break
        if k == 1:
            li.append(W[start:])
            break
        if W[start] == W[Next] :
            Next += 1
        else:
            if W[start:Next][0] not in first:
                li.append(W[start:Next])
                first.append(W[start:Next][0])
                k-=1
                start = Next
                Next = start + 1
            else:
                Next += 1

    if len(li) >= k:
        for I in li:
            print(I)
    else:
        print("NO")
