You are given a string q. A sequence of k strings s1, s2, ..., sk is called beautiful, if the concatenation of these strings is string q (formally, s1 + s2 + ... + sk = 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.

Input

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.

Output

If such sequence doesn't exist, then print in a single line "NO" (without the quotes). Otherwise, print in the first line "YES" (without the quotes) and in the next k lines print the beautiful sequence of strings s1, s2, ..., sk.

If there are multiple possible answers, print any of them.

Examples

Input

1
abca


Output

YES
abca


Input

2
aaacas


Output

YES
aaa
cas


Input

4
abc


Output

NO

Note

In the second sample there are two possible answers: {"aaaca", "s"} and {"aaa", "cas"}.
def main():
    mode="filee"
    if mode=="file":f=open("test.txt","r")
    #f.readline()
    #input()
    get = lambda :[int(x) for x in (f.readline() if mode=="file" else input()).split()]
    [k]=get()
    b=[False]*26
    q = input()
    if k>len(q):
        print("NO")
        return
    if k==1:
        print("YES")
        print(q)
        return
    done=[]
    i=-1
    last=0
    b[ord(q[0])-97]=True
    while i<len(q)-1 and k>0:
        i+=1
        if b[ord(q[i])-97]:
            continue
        done.append(q[last:i])
        b[ord(q[i])-97]=True
        last=i
        k-=1
    if k==0:done[-1]+=q[last:]
    else:
        done.append(q[last:])
        k-=1
    if k>0:
        print("NO")
    else:
        print("YES")
        for i in done:
            print(i)

    if mode=="file":f.close()


if __name__=="__main__":
    main()
