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 = input()
s = raw_input()
n = len(s)
present = []
points = []
for i in range(n):
    if s[i] not in present :
        present.append(s[i])
        points.append(i)
chrs = len(present)
if k > chrs:
    print "NO"
else:
    print "YES"
    counter = 0 
    points_len = len(points)
    while(k > 0):
        # print "counter, points len", counter, points_len
        if counter < points_len -1 and k > 1:
            # print "here"
            start = points[counter]
            end = points[counter+1]-1
            counter += 1
        else:
            start = points[counter]
            end = n-1
            counter += 1
        k -= 1
        # print start, end
        print s[start:end+1]
