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"}.
//package codec;

import java.util.*;
import java.io.*;
public class Main {

    public static void main(String[] args) throws IOException {
         BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
         PrintWriter pw=new PrintWriter(new OutputStreamWriter(System.out));
             //String s=br.readLine();
             int n=Integer.parseInt(br.readLine());
             String st=br.readLine();
             int ar[]=new int[26];
             int ar1[]=new int[26];
             ar[st.charAt(0)-'a']=1;
             int count=0;
             for(int i=1;i<st.length();i++){
                 if(ar[st.charAt(i)-'a']==0)
                    ar[st.charAt(i)-'a']=i+1;
                
             }
             Arrays.sort(ar);
             int min=0;
             int ind=0;
                    
             for(int i=0;i<26;i++){
                 if(ar[i]!=0){
                    count++;
                    ar1[ind++]=ar[i];
                 // pw.print(ar[i]+" ");
                 }
                 
             }
             if(count<n){
                 pw.print("NO");
             }
             else{
                 pw.println("YES");
                 int prev=0, j=0,index = 0,cou=0;
                 if(ind==1)
                     pw.println(st);
                 else{
                     //pw.println(ind);
                    int i=0;
                     for( i=0;i<ind-1;i++){
                     
                     if(cou==n-1){
                         pw.println(st.substring(ar1[i]-1, st.length()));
                         break;
                     }
                     pw.println(st.substring(ar1[i]-1,ar1[i+1]-1));
                     cou++;
                 }
                     if(i==ind-1)
                         pw.println(st.substring(ar1[ind-1]-1));
                 }
             }
            //pw.print(ans+"\n");
                pw.flush();     
            
         
         
         
            
    }

}