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"}.
n = int(input())
s = list(str(input()))
dif = list(dict.fromkeys(s))
ans = []
if(n==1):
    print('YES')
    print(''.join(s))
else:
    cur = 0
    pnt = 0
    lst = s[0]
    cnt = 1
    used = [s[0]]
    for i in range(len(s)):
        if(s[i] not in used):
            if(i==len(s)-1 or cnt== n-1):
                ans.append(''.join(s[cur:i]))
                ans.append(''.join(s[i:]))
                break
            else:
                ans.append(''.join(s[cur:i]))
            cur = int(i)
            cnt+=1
            used.append(s[i])
    if(len(ans)==n):
        print('YES')
        for i in range(n):
            print(ans[i])
    else:
        print('NO')
