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.
r = lambda : map(int,input().split())

import sys
n = int(input())
s = input()
q = set()
if n>len(set(s)) :
    print('NO')
else :
    print('YES')
    k = 0
    ans = []
    for i in range(len(s)) :
        if k==len(s)-1 : break
        if s[i] not in q :
            ans.append(i)
            q.add(s[i])
            k+=1
    ans.append(len(s))
    for i in range(len(ans)-1) :
        print(s[ans[i]:ans[i+1]])
                
