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.
def find_beautiful_sequence(k, q):
    first_chars = set()
    sequence = []

    for i in range(len(q)):
        char = q[i]
        if char not in first_chars:
            first_chars.add(char)
            sequence.append(q[:i + 1])
            q = q[i + 1:]

    if len(sequence) < k:
        return "NO"
    else:
        return "YES\n" + '\n'.join(sequence[:k])

# Read input
k = int(input())
q = input().strip()

# Find a beautiful sequence of strings
result = find_beautiful_sequence(k, q)
print(result)
