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()
freq = []
for i in range(26):
    freq.append(0)
uniq = 0

for c in s:
    freq[ord(c) - 97] += 1

for i in range(26):
    if freq[i]:
        uniq += 1

if uniq < k:
    print("NO")

else:
    print("YES")
    prev = 'A'
    cnt = 0

    L = s.__len__()
    i = 0
    while i < L:
        if cnt < k - 1:
            ans = s[i]
            prev = s[i]
            i += 1
            while i < L and s[i] == prev:
                ans += s[i]
                prev = s[i]
                i += 1
            cnt += 1
            print(ans)

        else:
            ans = ""
            while i < L:
                ans += s[i]
                i += 1
            print(ans)
            break