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 solve():
    n = int(input())
    s = str(input())
    ck = [0 for i in range(200)]
    cnt = 0
    for i in range(len(s)):
        ck[ord(s[i])] += 1
        if ck[ord(s[i])] == 1:
            cnt += 1
    if cnt < n:
        print("NO")
        return
    print("YES")
    for i in range(200):
        ck[i] = 0
    tar = s[:1]
    ck[ord(s[0])] += 1
    for i in range(1, len(s)):
        ck[ord(s[i])] += 1
        if ck[ord(s[i])] == 1:
            n -= 1
            print(tar)
            tar = ""
            if n == 1:
                print(s[i:])
                break
        tar += s[i]
    if n:
        print(tar)

t = 1
# t = int(input())
while True:
    solve()
    t -= 1
    if t <= 0:
        break