You are given a string q. A sequence of k strings s1, s2, ..., sk is called beautiful, if the concatenation of these strings is string q (formally, s1 + s2 + ... + sk = 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.

Input

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.

Output

If such sequence doesn't exist, then print in a single line "NO" (without the quotes). Otherwise, print in the first line "YES" (without the quotes) and in the next k lines print the beautiful sequence of strings s1, s2, ..., sk.

If there are multiple possible answers, print any of them.

Examples

Input

1
abca


Output

YES
abca


Input

2
aaacas


Output

YES
aaa
cas


Input

4
abc


Output

NO

Note

In the second sample there are two possible answers: {"aaaca", "s"} and {"aaa", "cas"}.
__author__ = 'emcenrue'
from string import ascii_lowercase
#
dict = dict()

for c in ascii_lowercase:
    dict[c] = 0

k = int(input())
q = input()
list = list()
ans = 0
i = 0
for c in q:
    if dict[c] == 0 and ans < k:
        ans+=1
        dict[c] = 1
        list.append(i)
    i+=1


if ans >= k:
    print("YES")
    if len(list) == 1:
        print(q[list[0]:len(q)])
    for i in range(len(list)-1):
        print(q[list[i]:list[i+1]])
        if i == len(list) - 2:
            print(q[list[i+1]:len(q)])
else:
    print("NO")
