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 -*-

import sys
import itertools

k = int(sys.stdin.readline().strip())
q = sys.stdin.readline().strip()

if len(set(q)) < k:
    print 'NO'
else:
    res = []
    choices = set()
    indexes = []
    for idx, symbol in enumerate(q):
        if symbol in choices:
            continue
        else:
            choices.add(symbol)
            indexes.append(idx)
    indexes = indexes[:k]
    pairs = itertools.izip_longest(indexes, indexes[1:])
    for pair in pairs:
        start, end = pair
        if end is None:
            res.append(q[start:])
        else:
            res.append(q[start:end])

    print 'YES'
    for row in res:
        print row
