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"}.
[k] = map(int, raw_input('').split(' '))
word = raw_input('')
n = len(word)

is_used = [False] * 26
parts = []

for alpha in word:
    is_first_occurence = not is_used[ord(alpha) - ord('a')]
    count = len(parts)
    is_used[ord(alpha) - ord('a')] = True

    if is_first_occurence and count < k:
        parts.append([alpha])
    elif (not is_first_occurence and count < k) or (count == k):
        parts[count - 1].append(alpha)

if len(parts) == k:
    print 'YES'
    for part in parts:
        print ''.join(part)
else:
    print 'NO'
