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.*;
import java.util.*;


public class Solution{  
	
	
	
	
 public static void main(String[] args) {
     
     Scanner in = new Scanner(System.in);
     
     
     int n,k,i,dist=0;
     String s;
     int[] check=new int[26];
     
     k=in.nextInt();
     s=in.next();
     n=s.length();
     
     for(i=0;i<n;i++){
    	 check[(int)(s.charAt(i)-'a')]=1;
     }
     
     for(i=0;i<26;i++)dist+=check[i];
     
     if(k<=dist){
    	 System.out.println("YES");
    	 int[] a=new int[k+1];
    	 a[0]=0;
    	 a[k]=n;
    	 
    	 check=new int[26];
    	 int num=0;
    	 
    	 for(i=0;i<n;i++){
    		 char temp=s.charAt(i);
    		 
    		 if(check[(int)(temp-'a')]==0){
    			 check[(int)(temp-'a')]=1;
    			 a[num]=i;
    			 num++;
    			 if(num==k)break;
    		 }
    		 
    	 }
    	 
    	 
    	 
    	 for(i=0;i<k;i++){
    		 for(int j=a[i];j<a[i+1];j++){
    			 System.out.print(s.charAt(j));
    		 }
    		 System.out.println();
    	 }
    	 
     }
     else{
    	 System.out.println("NO");
     }
     
 }
}
