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"}.
#coding=utf-8
flag = []
index = []
for i in range(26):
    flag.append(False)
count = 0
k = int(input())
string = input()
for i in range(len(string)):
    char = ord(string[i]) - ord('a')
    if count == k:
        break
    if not flag[char]:
        flag[char] = True
        count += 1
        index.append(i)

if count >= k:
    print("YES")
    for i in range(k - 1):
        index_s = index[i]
        index_e = index[i + 1]
        print(string[index_s : index_e])
    print(string[index[k - 1] : ])
else:
    print("NO")
