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.
import math


def main_function():
    k = int(input())
    s = input()
    counter = 0
    hash_of_a = [-1 for i in range(150)]
    collector = []
    for i in range(len(s)):
        if hash_of_a[ord(s[i])] == -1:
            hash_of_a[ord(s[i])] = i
            collector.append(i)
            counter += 1
    if counter < k:
        print("NO")
    else:
        print("YES")
        collector.append(len(s))
        collector.sort()
        indexi = 0
        internal_counter = collector[indexi]
        print(collector)

        for j in range(len(s) + 1):

            if j < collector[indexi + 1]:
                print(s[j], end="")
            else:
                k -= 1
                print("")
                if k == 1:
                    print(s[j:])
                    break
                else:
                    print(s[j])
                    indexi += 1














main_function()
