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 Solution544A {
	public static void main(String[] args) {
		// Read input
		Scanner in = new Scanner(System.in);
		int k = in.nextInt();
		String str = in.next();
		int[] c = new int[26];
		
		
		
		int count = 0;
		for (int i = 0; i < str.length(); i++) {
			if (c[str.charAt(i) - 'a'] == 0)
				count++;
			c[str.charAt(i) - 'a']++;
		}
		
		
		//Determine if there are enough strings
		if (count < k ) 
			//NO
			System.out.println("NO");
		else {
		//YES. print all strings
			System.out.print("YES");
			int count1 = 0;
			for (int i = 0; i < str.length(); i++) {
			  if (count1 < k && c[str.charAt(i) - 'a'] != 0) {
					count1++;
					System.out.println("");
					System.out.print(str.charAt(i));
					c[str.charAt(i) - 'a'] = 0;
				}
				else
					System.out.print(str.charAt(i));
			}
		}
		System.out.println("");
	}
}
