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_ = input()
k = int(k_)

q= input()

chString = ''
index = 0
indexQ = []

if len(q)<k:
    print("NO")
else:
    for ch in q:
        
        if ch not in chString:
            chString += ch
            indexQ.append(index)
        index += 1

    if len(chString)<k:
        print("NO")
    else:
        print("YES")
        previous = 0
        for i in range(1,k+1):
            #print(i)
            if i==k:
                print(q[previous:])
            else:
                m= indexQ[i]
                print(q[previous:m])
                previous=m
            
