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"}.
# Contest: 20 - 2100 <= Codeforces Rating <= 2199 (https://a2oj.com/ladder?ID=20)
# Problem: (12) Laptops (Difficulty: 3) (http://codeforces.com/problemset/problem/456/A)

def rint():
    return int(input())


def rints():
    return list(map(int, input().split()))


k = rint()
q = input()
p = [1000] * 26
for i, c in enumerate(q):
    p[ord(c) - ord('a')] = min(i, p[ord(c) - ord('a')])
pv = [i for i in p if i < 1000]
if len(pv) < k:
    print('NO')
    exit(0)
pv = sorted(pv)
print('YES')
for i in range(k):
    if i == k - 1:
        print(q[pv[i]:])
    else:
        print(q[pv[i]:pv[i + 1]])
