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.
from collections import Counter


number_of_words = int(input())
input_string = input()
words_dict = Counter(input_string)
if len(words_dict) < number_of_words:
    print('NO')
else:
    print('YES')
    if number_of_words == 1:
        print(input_string)
    else:
        for i in range(0, number_of_words - 1):
            output_string = ''
            current_letter = input_string[0]
            while True:
                if current_letter == input_string[0]:
                    output_string += current_letter
                    input_string = input_string[1:]
                else:
                    break
            print(output_string)
        print(input_string)