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.
n=int(input())
s=input()
a = {chr(a):False for a in range(ord('a'),ord('z')+1)}
ans = []

def printans():
    print('YES')
    print(' '.join(ans))

if n==1:
    print('YES')
    print(s)
    exit()
else:
    for i in range(len(s)):
        if len(ans) == n-1 and not a[s[i]]:
            ans.append(s[i:])
            printans()
            exit()
        elif not a[s[i]]:
            for j in range(i+1, len(s)):
                if s[i]!=s[j]:
                    ans.append(s[i:j])
                    a[s[i]]=1
                    i=j-1
                    break
    print('NO')
                    
