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()
if len(s)<k:
    print("No")
else:
    nums=[]
    letters=set()
    for i in range(len(s)):
        if s[i] not in letters:
            letters.add(s[i])
            nums.append(i)
    if len(s)<k:
        print("No")
    else:
        print("Yes")
        index=1
        res=s[0]
        for i in range(1,len(s)):
            if i!=nums[index]:
                res+=s[i]
            else:
                if k!=1:
                    print(res)
                    res=s[i]
                    k-=1
                    index+=1
                else:
                    res+=s[i]
        if k:
            print(res)
                
            