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.*;


public class SetOfStrings {

	public static void main(String[] args) {
		
		int num;
		String seq;
		boolean[] ch = new boolean[26];
		int cnt = 0;
		
		for(int i=0; i<26; i++)
			ch[i] = false;
	
		Scanner sc = new Scanner(System.in);
		Scanner sc2 = new Scanner(System.in);
		num = sc.nextInt();
		seq = sc.next();
		int[] arr = new int[num+1];
		arr[num] = seq.length();
		if(num<1 || num>26){
			System.out.println("NO");
			System.exit(0);
		}
		
		if(seq.length() >100){
			System.out.println("NO");
			System.exit(0);
		}
		
		for(int i=0; i<seq.length(); i++){
			int ck = seq.charAt(i)-'a';
			
			if(!ch[ck]){
				ch[ck] = true;
				arr[cnt] = i;
				cnt++;
			}
			
			if(cnt == num)
				break;
		}
		
		if(cnt < num){
			System.out.println("NO");
		} else{
			System.out.println("YES");
			for(int i=0,j=0; i<num; i++,j++){
				
				System.out.println(seq.substring(arr[j], arr[j+1]));
			}
		}
		
	}
}



