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 java.io.*;
public class setofstrings {

    public static void main(String[] args)throws IOException {
        // TODO Auto-generated method stub
        
        BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
        
        int k = Integer.parseInt(r.readLine());
        
        String q = r.readLine().trim();
        
        int ar[] = new int[26];
        
        for(int i = 0;i<26;i++){
            ar[i] = 0;
        }
        
        String str[] = new String[k];
        
        if(k==1){
            System.out.println("YES");
            System.out.println(q);
        }
        else{
        int s = 0;
        int e = 0;
        int a = Character.valueOf(q.charAt(s));
        a = a-97;
        ar[a] = 1;
        e = e+1;
        int c = 0;
        while(e<q.length()){
            
            a = Character.valueOf(q.charAt(e));
            a = a-97;
            //System.out.println(a);
            if(ar[a]==0){
                str[c] = q.substring(s, e);
                
                //e = e+1;
                s = e;
                c = c+1;
                if(c==k-1){
                    str[c] = q.substring(s,q.length());
                    c = c+1;
                    break;
                }
                ar[a]=1;
            }
            else{
                e = e+1;
            }
            
        }
        
        if(c==k){
            
            System.out.println("YES");
            for(int i = 0;i<k;i++){
                System.out.println(str[i]);
            }
        }
        else{
            System.out.println("NO");
        }
        }

    }

}
