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())
q = input()

def program(k, q):
    if k > len(set(q)):
        print("NO")
        return
    used = []
    ss = []
    while len(q) > 0:
        ch = q[0]
        q = q[1:]
        if (ch in used) or k - len(ss) == 0:
            ss[-1] += ch
        else:
            ss.append(ch)
        used.append(ch)
    print("YES")
    for s in ss:
        print(s)
    
program(k, q)
    
