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.
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

k = int(input())
str = input()

dic = {}
for i in str:
    if i not in dic:
        dic[i]  = 1
    else:
        dic[i] += 1

if ( k > len(dic)):
    print("NO")
else:
    print("YES", end='')
    dic2 = []
    n = 0

    for i in str:
        if (i not in dic2) and n < k:
            print()
            print(i, end='')
            n += 1
            dic2.append(i)
        else:
            print(i, end='')

    print()

