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 = input()
word = input()
list = []
list2 = []
for i in word:
    if i not in list:
        list.append(i)
count = 0
if len(list) < int(k):
    print("NO")
else:
    print("YES")
    list = list[:int(k)]
    for i in range(len(word)):
        if word[i:i+1] == list[count]:
            list2.append(i)
            #print(i)
            count += 1
            if count == int(k):
                break
    for i in range(len(list2)-1):
        string = word[list2[i]:list2[i+1]]
        print(string)
    print(word[list2[len(list2)-1]:])