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.
k = int(input())
q = input().strip()

# Initialize a list to store the strings in the beautiful sequence
beautiful_sequence = []

# Initialize a set to keep track of the first characters used
used_first_chars = set()

# Iterate through the characters of the string q
for i, char in enumerate(q):
    # Check if the current character is not in the used_first_chars set
    if char not in used_first_chars:
        # If it's not in the set, create a new string and add it to the beautiful_sequence
        beautiful_sequence.append(q[:i + 1])
        used_first_chars.add(char)

# Check if we found k strings in the beautiful sequence
if len(beautiful_sequence) == k:
    print("YES")
    for string in beautiful_sequence:
        print(string)
else:
    print("NO")
