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"}.
#!/usr/bin/env python
# -*- coding: utf-8 -*-

from collections import defaultdict
from math import factorial as f
from fractions import gcd as g

K = int (raw_input ())
s = raw_input ()
l = []
if len (set (s)) < K: print "NO"
else:
    print "YES"
    d = defaultdict (int)
    d [s [0]] = 1
    ret = s [0]
    s = s [1:]
    while s:
        c = s [0]
        if d [c] == 1:
            ret += c
        else:
            l.append (ret)
            ret = c
            d [c] = 1
        s = s [1:]
    if ret: l.append (ret)
    for i in range (K - 1): print l [i]
    print "".join (l [K - 1:])

