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.
# http://codeforces.com/problemset/problem/544/A
def main():
    n = int(input())
    s = str(input())
    if n > len(s):
        print('NO')
        return
    elif n == 1:
        print('YES')
        print(s)
    else:
        strings = []
        letters = len(set(list(s)))
        if letters < n:
            print('NO')
            return
        curr = s[0]
        comp = s[0]
        used = {s[0]: 1}
        cant = 0
        for i in range(1, len(s)):
            if s[i] == comp:
                curr += s[i]
            else:
                strings.append(curr)
                cant += 1
                curr = s[i]
                comp = s[i]
                check = used.get(comp, -1)
        
                if check != -1:
                    print('NO')
                    return
                else:
                    used[comp] = 1

                if cant == n and i != len(s) -1:
                    strings[-1] = strings[-1] + s[i:]
                    break
        print('YES')
        for i in strings:
            print(i)
main()