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"}.
k = int(input())
string = input()
first_char_set = set()
length = len(string)
unique_mnt = 0
res_ind = []
if k > length:
    print("NO")
    exit(0)
if k == 1:
    print("YES")
    print(string)
    exit(0)
for i in range(length):
    c = string[i]
    if not(c in first_char_set):
        unique_mnt += 1
        first_char_set.add(c)
        res_ind.append(i)
if k > len(res_ind):
    print("NO")
    exit(0)
res = []
res_len = len(res_ind)
for i in range(res_len - 1):
    cur_ind = res_ind[i]
    next_ind = res_ind[i+1]
    if k > 1:
        res.append(string[cur_ind:next_ind])
        k -= 1
    elif k == 1:
        res.append(string[cur_ind:])
        k -= 1
        break
if k == 1:
    res.append(string[next_ind:])
print("YES")
for el in res:
    print(el)
