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 = 0
num = int(input())
concat = raw_input()

def is_beautiful(num, concat):
    unique_start = {}
    idx = 0
    beautiful_list = []
    for i in range(0, num):
        start_idx = idx
        if (idx == len(concat)):
            print "NO"
            return
        found = False
        while idx < len(concat) and not found:
            if not(concat[idx] in unique_start):
                unique_start[concat[idx]] = True
                found = True
                if(i != 0):
                    beautiful_list.append(concat[start_idx-1:idx])
            idx = idx + 1
        if not found:
            print "NO"
            return

    beautiful_list.append(concat[idx-1:])

    print "YES"
    for s in beautiful_list:
        print s

is_beautiful(num, concat)
