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.
k = int(input())
s = input()
if len(set(s)) < k:
    print('NO')
else:
    ans = []
    seen = set(s[0])
    curr = ''
    for c in s:
        if c in seen:
            curr += c
        else:
            seen.add(c)
            ans.append(curr)
            curr = c
    ans.append(curr)
    print('YES')
    print('\n'.join([ans[i] for i in range(k-1)] + [''.join(ans[k-1:])]))
