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"}.
import math

def solve():
    n = int(input())
    s = str(input())
    if n == 1:
        print("YES")
        print(s)
        return
    ck = [0 for i in range(200)]
    cnt = 0
    for i in range(len(s)):
        ck[ord(s[i])] += 1
        if ck[ord(s[i])] == 1:
            cnt += 1
    if cnt < n:
        print("NO")
        return
    print("YES")
    for i in range(200):
        ck[i] = 0
    tar = s[:1]
    ck[ord(s[0])] += 1
    for i in range(1, len(s)):
        ck[ord(s[i])] += 1
        if ck[ord(s[i])] == 1:
            n -= 1
            print(tar)
            tar = ""
            if n == 1:
                print(s[i:])
                return
        tar += s[i]
    if n:
        print(tar)

t = 1
# t = int(input())
while True:
    solve()
    t -= 1
    if t <= 0:
        break