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 = str(input())
a = []
c = 0
b = []
part = ''
for el in range(len(s)):
        if(s[el] not in b):
            a.append(part)
            part = ''
            part += s[el]
            b.append(s[el])
        else:
            part += s[el]
        c += 1
a.append(part)
a = a[1:]

if(len(a) < k):
     print('NO')
else:
     print('YES')
    
     a[k-1] = ''.join(a[k-1:])
     for el in range(k):
          print(a[el])