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):
    if k > len(q):
        return "NO"

    # Check if it's possible to form a beautiful sequence
    unique_chars = set(q)
    if len(unique_chars) < k:
        return "NO"

    # Construct the beautiful sequence
    sequence = [q[i] for i in range(k)]
    return "YES\n" + "\n".join(sequence)

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

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