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"}.
# -*- coding: utf-8 -*-
#ᕕ┌◕ᗜ◕┐ᕗ HELLO HELLO HELLO ᕕ┌◕ᗜ◕┐ᕗ

k = int(raw_input())
q = raw_input()
d = {}
for i in q:
    if i in d:
        d[i] += 1
    else:
        d[i] = 1
if len(d.keys()) < k:
    print "NO"
else:
    print "YES"
    s,e = 0,0
    sc = []
    while e < len(q) and q[s] == q[e]:
        e += 1
    k -= 1
    while k != 0:
        print q[s:e]
        sc.append(q[s])
        s = e
        while e < len(q) and (q[e] in sc or q[s] == q[e]):
            e += 1
        k -= 1
    e = len(q)-1
    print q[s:e+1]
