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 sys import stdin, stdout
n = int(stdin.readline())
line = stdin.readline().strip()
arr = dict()
char_arr = list(line)
for char in char_arr:
    if char in arr:
        arr[char] = 0
    else:
        arr[char] = 1

disc = []
for key in arr:
    # print line.index(key)
    disc.append(line.index(key))
    # if(arr[key]==1):
    #     d = d + 1
d = len(disc)
disc.sort()
if(d>=n):
    stdout.write("YES\n")
    for x in range(0, n):
        if(x+1==n):
            print line[disc[x]: len(line)]
        else:
            print line[disc[x]: disc[x+1]]
else:
    stdout.write("NO")
