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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.TreeSet;

public class BeautifulStrings {

	public static void main(String[] args) throws IOException {
		int N;
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		N = Integer.parseInt(br.readLine());
		String inputs = br.readLine();
		char[] input = (inputs).toCharArray();
		ArrayList<Character> list = new ArrayList<>();
		TreeSet<Character> ts = new TreeSet<>();
		int len = input.length;

		for (int i = 0; i < input.length; i++) {
			if (ts.add(input[i]))
				list.add(input[i]);
		}

		int poss = list.size() ;

		if (poss >= N) {
			System.out.println("YES");
			int t = N;
			int end = 1;
			int prv = 0;
			int i = 1;
			while (t > 1) {
				end = inputs.indexOf(list.get(i));
				System.out.println(inputs.substring(prv, end));
				i++;
				prv = end;
				t--;
			}
			System.out.println(inputs.substring(prv));

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