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())
q = input()
if n > len(q):
    print("NO")
else:
    if n == 1:
        print("YES")
        print(q)
    else:
        arr = [0]*len(q)
        for x in range(0, len(q)):
            arr[x] = q[x]

        con = arr[0]
        res = []
        count = 0
        x = 0
        used = ["-1"]*len(q)
        used[0] = con
        usedCount = 0
        while count < n-1:
            if x + 1 < len(arr) and (arr[x] == arr[x+1] or arr[x+1] in used):
                con += arr[x+1]
                x += 1
            else:
                res.append(con)
                usedCount += 1
                if x + 1 < len(arr):
                    used[usedCount] = arr[x+1]
                    con = arr[x+1]
                count +=1
                x += 1
        totalLen = 0
        for x in range(0, count):
            totalLen += len(res[x])
        res.append(q[totalLen:])
        for x in res:
            if x.isspace() or x == "":
                res.remove(x)
        res1 = set(res)
        length = 0

        for each in res1:
            length += 1
        if res[len(res) - 1] == "-1" or length < n:
            print("NO")
        else:
            print("YES")
            for x in res:
                print(x)