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,f,ls = int(input()),input().strip(),set()
if k > len(f):
    print('NO')
else:
    s = []
    f1 = ''
    for i in f + ' ':
        if not i in ls:
            if f1:
                s.append(f1)
            ls.add(i)
            f1 = i
        else:
            f1 += i
    if len(s) < k:
        print('NO')
    else:
        print('YES')
        for i in range(k - 1):
            print(s[i])
        f = ''
        for i in s[k - 1:]:
            f += i
        print(f)