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"}.
#!/usr/bin/python
# -*- encoding: utf-8 -*-
# pylint: disable=invalid-name,missing-docstring,bad-builtin
from sys import stdin

def main():
    dstream = iter(stdin.read().split())
    k = int(next(dstream))
    s = next(dstream)
    if len(set(s)) < k:
        print 'NO'
        return
    print 'YES'
    arr = [[s[0]]]
    starts = set([s[0]])
    for x in xrange(1, len(s)):
        if len(arr) == k:
            for y in xrange(x, len(s)):
                arr[-1].append(s[y])
            break
        if s[x] not in starts:
            arr.append([s[x]])
            starts.add(s[x])
        else:
            arr[-1].append(s[x])

    print '\n'.join(map(''.join, arr))

main()
