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"}.
import sys

def main():
    k=int(raw_input())
    s=raw_input()
    arr=[0]*26
    cnt=0
    for i in range(0,len(s)):
        idx=ord(s[i])-ord('a')
        if(arr[idx]==0):
            cnt+=1
            arr[idx]=1
    if cnt<k:
        print "NO"
    else:
        print "YES"
        cnt=0
        fg=0
        a=[0]*26
        for i in range(0,len(s)):
            idx=ord(s[i])-ord('a')
            if a[idx]==1 or cnt==k:
                print s[i],
                sys.stdout.softspace=0
            else:
                if fg==0:
                    print s[i],
                    sys.stdout.softspace=0
                    fg=1
                else:

                    print "\n"+s[i],
                sys.stdout.softspace=0
                a[idx]=1
                cnt+=1

main()