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.
n = int(input())
string = input()
arr = list(string)

if len(set(arr)) < n:
    print("NO")
else:
    idx = 0
    ans = list()
    chars = set()

    while n > 0:
        n -= 1
        if n == 0:
            ans.append(string[idx:])
        else:
            chars.add(string[idx])
            start = idx
            idx += 1
            while idx < len(string) and string[idx] in chars:
                idx += 1
            ans.append(string[start:idx])

    print("YES")
    print('\n'.join(ans))