You are given a string *q*. A sequence of *k* strings *s*<sub class="lower-index">1</sub>, *s*<sub class="lower-index">2</sub>, ..., *s*<sub class="lower-index">*k*</sub> is called beautiful, if the concatenation of these strings is string *q* (formally, *s*<sub class="lower-index">1</sub> + *s*<sub class="lower-index">2</sub> + ... + *s*<sub class="lower-index">*k*</sub> = *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.
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.
from collections import defaultdict

n, s, mem, ans, tem = int(input()), input(), defaultdict(int), '', ''
for i, j in enumerate(s):
    if n == 0:
        ans += s[i:]
        exit(print('YES', ans[1:], sep='\n'))
    if mem[j] == 0:
        ans += '\n' + j
        n -= 1
        mem[j]=1
    else:
        ans += j
print('NO')
