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

    beautiful_sequence = [q[:i] for i in range(1, k)]
    beautiful_sequence.append(q[k-1:])

    return "YES", beautiful_sequence

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

# Find or determine if a beautiful sequence exists
result = find_beautiful_sequence(k, q)

# Print the result
if result == "NO":
    print("NO")
else:
    print("YES")
    for string in result[1]:
        print(string)

# Example usage:
# input:
# 2
# aaacas
# output:
# YES
# aaa
# cas
