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.io.*;
import java.util.*;

public class Strings {
	public static void main(String args[]) throws Exception {
		Scanner in;
		try {
			in = new Scanner(new File("input.txt"));
		}
		catch (Exception e) {
			in = new Scanner(System.in);
		}
		int k = in.nextInt();
		String str = in.next();
		ArrayList<Integer> arch = new ArrayList<Integer>();
		boolean[] alpha = new boolean[26];
		int count = 0;
		for (int i = 0; i < str.length(); i++) {
			if (!(alpha[str.charAt(i) - 'a'])) {
				alpha[str.charAt(i) - 'a'] = true;
				arch.add(i);
				count++;
			}
			if (count == k) break;
		}
		if (count < k) System.out.println("NO");
		else {
			System.out.println("YES");
			arch.add(str.length());
			for (int i = 0; i < k ; i++) {
				System.out.println(str.substring(arch.get(i), arch.get(i+1)));
			}
		}
	}

}