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.
#coding=utf-8
flag = []
index = []
for i in range(26):
    flag.append(False)
count = 0
k = int(input())
string = input()
for i in range(len(string)):
    char = ord(string[i]) - ord('a')
    if count == k:
        break
    if not flag[char]:
        flag[char] = True
        count += 1
        index.append(i)

if count >= k:
    print("YES")
    for i in range(k - 1):
        index_s = index[i]
        index_e = index[i + 1]
        print(string[index_s : index_e])
    print(string[index[k - 1] : ])
else:
    print("NO")
