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"}.
from collections import defaultdict

k = int(raw_input())
q = raw_input()
# k = 2
# q = 'aaacas'

dic = defaultdict(bool)
s = ''
S = []
for c in q:
    # print c, dic[c]
    if not dic[c]:
        dic[c] = True
        if len(s)>0:
            S.append(s)
        s = c
    else:
        s += c
if s:
    S.append(s)

# print S

if k == 1:
    print "YES"
    print q
elif len(S) < k:
    print "NO"
else:
    print "YES"
    # print len(S), S[k:]
    if len(S) > k:
        S[k-1] = S[k-1] + ''.join(S[k:])
    for s in S[:k]:
        print s

