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

"""
created by huash06 at 2015-05-18 15:10
"""
__author__ = 'huash06'

import sys
import os
import datetime
import functools
import itertools
import collections



def findBeautifulStr(astr, n):
    res = []
    firsts = set()
    i = 0
    while i < len(astr):
        firsts.add(astr[i])
        if len(res) == n - 1:
            res.append(astr[i:])
            break

        hasNext = False
        for j in range(i+1, len(astr)):
            if astr[j] not in firsts:
                res.append(astr[i:j])
                i = j
                hasNext = True
                break
        if not hasNext:
            break

    if len(res) == n:
        return res
    return []



N = int(input())
S = input()

res = findBeautifulStr(S, N)
if res:
    print('YES')
    for seg in res:
        print(seg)
else:
    print('NO')
