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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Program {
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try{
			Scanner scanner = new Scanner(System.in);
			int n = scanner.nextInt();
			String[]str = scanner.next().split("");
			List list = new ArrayList();
			list.add(str[0]);
			int length = str.length;
			boolean [] check = new boolean [length];
			for (int i = 0; i < length; i++)
			{
				if (list.contains(str[i]) == false)
				{
					list.add(str[i]);
					check[i -1] = true;
				}
			}
			if (list.size() < n) 
			{
				System.out.print("NO");
			}
			else
			{
				int j = 1;
				int i = 0;
				System.out.println("YES");
				while (i < length)
				{
					if (j < n  )
					{
						if (check [i] == true)
						{
							System.out.println(str[i]);
							i++;
							j++;
						}
						else 
						{
							System.out.print(str[i]);
							i++;
						}
					}
					else 
					{
						System.out.print(str[i]);
						i++;
					}					
				}
			}
		} catch (Exception e){};
	}
}
