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 = list(str(input()))
dif = list(dict.fromkeys(s))
ans = []
if(n==1):
    print('YES')
    print(''.join(s))
else:
    cur = 0
    pnt = 0
    lst = s[0]
    cnt = 1
    for i in range(len(s)):
        if(s[i] != lst):
            if(i==len(s)-1 or cnt== n-1):
                ans.append(''.join(s[cur:i]))
                ans.append(''.join(s[i:]))
                break
            else:
                ans.append(''.join(s[cur:i]))
            cur = int(i)
            pnt+=1
            cnt+=1
            lst = s[i]
    if(len(ans)==n):
        print('YES')
        for i in range(n):
            print(ans[i])
    else:
        print('NO')
