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())
s=input()
a=set(list(s))
if(k>len(a)):
    print("NO")
else:
    print("YES")
    a=[s[0]]
    r=s[0]
    k-=1
    for i in range(1,len(s)):
        if(k==0):
            print(s[i-1:])
            break
        elif s[i] not in a:
            print(r)
            r=s[i]
            k-=1
        else:
            r+=s[i]