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.Scanner;
public class Beautiful {
    public static String isBeautiful(int n,String q){
    int i=0;
    String s=""+q.charAt(i);
    String compare=s;
    if (n==1) return "YES"+"\n"+q;
    for(i=0;i<q.length()-1;i++){
    	if (compare.contains(""+q.charAt(i+1))) s=s+q.charAt(i+1);
    		else {
    			if(countLines(s)<n){ compare+=q.charAt(i+1);
    			s=s+"\n"+q.charAt(i+1);
    		}
    		else {s=s+q.charAt(i+1);}
    	}
}
	if(countLines(s)==n) {
		return "YES"+"\n"+s;

		}
	else return"NO";

}
    public static int countLines(String str){
    String[] lines = str.split("\r\n|\r|\n");
    return  lines.length;
	}
	public static void main(String[]args){
	Scanner x=new Scanner(System.in);
	int p=x.nextInt();
	String o=x.next();
	System.out.println(isBeautiful(p,o));
	}
}




