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.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
    public static int N=0;
    public static String Q="";
    public static ArrayList<String>S; 
    
    public static void takeInput(){
        Scanner ob=new Scanner(System.in);
        N=ob.nextInt();
        ob.nextLine();
        Q=ob.nextLine();
    }
    
    public static int  noOfDiffChararcters(String str){
        int []arr = new int[200];
        int cnt=0;
        S=new ArrayList<String>();
        String temp="";
        for(int i=0;i<str.length();i++){
            arr[str.charAt(i)]++;           
            if(arr[str.charAt(i)]==1){
                cnt++;
                if(!temp.equals("") && cnt<=N){
                    S.add(temp);
                    temp="";
                }
            }
            temp=temp+str.charAt(i);        
        }
        if(!temp.equals("")){
            S.add(temp);
        }
        return cnt;
    }
    
    public static boolean isExists(String str,int k){
        if(k>noOfDiffChararcters(str)){
            return false;
        }           
        return true;
    }
    
    public static void main(String [] arg){
        
        takeInput();        
        if(isExists(Q, N)){
            System.out.println("YES");
            for(int i=0;i<S.size();i++){
                System.out.println(S.get(i));
            }
        return;
        }
        System.out.println("NO");
        
    }
    
    
}
