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"}.
# 544A
# O(|q|) time
# O(|q|) space

__author__ = 'artyom'


# SOLUTION

def main():
    b = [False] * 26
    n = read()
    s = read(0)
    if n == 1:
        return ['YES', s]
    tokens = ['YES']
    token = ''
    i = 1
    p = 0
    for c in s:
        if not b[ord(c) - 97]:
            b[ord(c) - 97] = True
            if token:
                tokens.append(token)
                i += 1
                if i == n:
                    break
                else:
                    token = ''
        token += c
        p += 1
    tokens.append(s[p:])
    if len(tokens) - 1 < n:
        return 'NO'
    return tokens


# HELPERS

def read(mode=1, size=None):
    # 0: String
    # 1: Integer
    # 2: List of strings
    # 3: List of integers
    # 4: Matrix of integers
    if mode == 0: return input().strip()
    if mode == 1: return int(input().strip())
    if mode == 2: return input().strip().split()
    if mode == 3: return list(map(int, input().strip().split()))
    a = []
    for _ in range(size):
        a.append(read(3))
    return a


def write(s="\n"):
    if s is None: s = ''
    if isinstance(s, tuple) or isinstance(s, list): s = '\n'.join(map(str, s))
    s = str(s)
    print(s, end="\n")


write(main())