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.*;
import java.io.*;
public class Set_of_Strings
{
	public static void main(String args[]) throws Exception
	{
		BufferedReader f=new BufferedReader(new InputStreamReader(System.in));
		int size=Integer.parseInt(f.readLine());
		Set<Character> set=new HashSet<Character>();
		String in=f.readLine();
		for(int x=0;x<in.length();x++)
			set.add(in.charAt(x));
		if(set.size()<size)
			System.out.println("NO");
		else
		{
			System.out.println("YES");
			int pos=0;
			int counter=1;
			Set<Character> dup=new HashSet<Character>();
			while(pos<in.length())
			{
				int prev=pos;
				dup.add(in.charAt(pos));
				pos++;
				while(pos<in.length()&&(counter==size||dup.contains(in.charAt(pos))))
					pos++;
				counter++;
				System.out.println(in.substring(prev,pos));
			}
		}
	}
}