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 SetOfStrings{
	public static void main(String args[])throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int want = Integer.parseInt(br.readLine());
		String test = br.readLine();
		BitSet b = new BitSet(26);
		char ch;
		int i;
		for(i = 0; i < test.length(); i++){
			ch = test.charAt(i);
			if(b.get(ch-97) == false)
				b.flip(ch-97);
		}
		if(b.cardinality() >= want){
			System.out.println("YES");
			i = 0;
			int j = 1;
			while(want!=1){
				ch = test.charAt(i);
				
				if(b.get(ch-97) == true){
					b.flip(ch-97);
					while(b.get(test.charAt(j)-97) == false)
						j++;
					System.out.println(test.substring(i,j));
					want--;
					i = j;
					j = i+1;
				}
				else
					i++;
			}
			while(b.get(test.charAt(i)-97)!=true)
				i++;
			System.out.println(test.substring(i,test.length()));
		}
		else
			System.out.print("NO");
	}
}