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(raw_input())
s = list(raw_input())

i = 0
result = []
cur = []

d = {}

while n > 0 and i < len(s):
    if len(cur) == 0:
        d[s[i]] = True
        cur.append(s[i])
    elif s[i] == cur[0] or n == 1:
        cur.append(s[i])
    else:
        if s[i] in d:
            cur.append(s[i])
        else:
            n -= 1
            result.append(cur)
            cur = [s[i]]
            d[s[i]] = True

    i += 1

    if i == len(s):
        n -= 1
        result.append(cur)
        break

if n > 0:
    print 'NO'
else:
    print 'YES'
    for i in xrange(len(result)):
        print ''.join(result[i])

