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()
if(n>len(s)):
    print("NO")
else:
    if(n==1):
        print("YES",s,sep="\n")
        exit(0)
    l=[]
    temp=0
    for i in range(len(s)-1):
        if(len(l)>n-1):
            l[-1]+=s[temp:]
            break
        if(s[temp]!=s[i+1]):
            l.append(s[temp:i+1])
            temp=i+1

    print("YES",*l,sep="\n")