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 _544A {

	public static void main(String[] args) {
		Scanner read = new Scanner(System.in);
		int n = read.nextInt();
		String q = read.next();
		ArrayList<String> k = new ArrayList<String>();
		int i = 1, j = 1;
		String ki = q.charAt(0) + "";
		if (n <= q.length()) {
			while (j < n && i < q.length()) {
				if (q.charAt(i) == q.charAt(i - 1) || q.charAt(i)==ki.charAt(0)) {
					ki += q.charAt(i);
					i++;
				} else {
					boolean b = true;
					
					for(int x=0;x<k.size() && b; x++){
						if (k.get(x).charAt(0)==q.charAt(i)){
							b = false;
						}
					}
					if(b){
						k.add(ki);
						ki = q.charAt(i) + "";
						i++;
						j++;
					}else{
						ki += q.charAt(i);
						i++;
					}
					
				}
			}
			for (i = i; i < q.length(); i++)
				ki += q.charAt(i);
			k.add(ki);
			if (j == n) {
				System.out.println("YES");
				for (String s : k)
					System.out.println(s);
			} else
				System.out.println("NO");

		} else {
			System.out.println("NO");

		}
	}

}
