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


public class R302D2A {
	public static void main(String[] arg){
		Scanner sc = new Scanner(System.in);
		String s1 = sc.nextLine();
		String s2 = sc.nextLine();
		int i = Integer.parseInt(s1);
		ArrayList<String> b = new ArrayList<String>();
		ArrayList<String> c = new ArrayList<String>();
		for (int j = 0;j<s2.length();j++){
			if (!c.contains(s2.charAt(j)+"")){
				b.add(s2.charAt(j)+"");
				c.add(s2.charAt(j)+"");
			}
			else{

				b.set(b.size()-1, b.get(b.size()-1)+s2.charAt(j));
			}
		}
		if (i>b.size()) {
			System.out.println("NO");
		}
		else{
			System.out.println("YES");
			for (int j=0;j<i;j++){
				if (j==i-1){
					String s = "";
					for (int k=j;k<b.size();k++){
						s+=b.get(k);
					}
					System.out.println(s);
				}
				else{
					System.out.println(b.get(j));
				}
			}
		}
	}
		
}
