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()) 
q = input() 
strings = []
s = ''
c = 0 
for i in range(len(q)): 
    if s == '' : s+=q[i];continue
    if q[i] == s[-1] : s += q[i] 
    else : 
        c += 1
        if c >= k: s += q[i]
        else : strings.append(s); s = q[i] 
strings.append(s)
ans = "YES" 
if len(strings) < k : print("NO")
else : 
    for i in range(len(strings)-1): 
        if strings[i][0] == strings[i+1][0] : ans = "NO"; break 
    print(ans) 
    if ans == "YES" : 
        for i in strings : print(i) 
