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())
sona = input()
letters = set(sona)

if(k == 1):
    print("YES")
    print(sona)
    exit()

if(len(letters) < k):
    print("NO")
    exit()

print("YES")

wordIndexList = []
char = sona[0]
letters.remove(sona[0])

for i in range(len(sona)):
    if(sona[i] == char):
        continue
    if(sona[i] != char and sona[i] in letters):
        #split at i
        wordIndexList.append(i)
        char = sona[i]
        letters.remove(sona[i])

start = 0
for i in range(k):
    if(i != k-1):
        print(sona[start:wordIndexList[i]])
        start = wordIndexList[i]
    else:
        print(sona[start:])
