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

public class CF544A {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int k = Integer.parseInt(br.readLine());
		String s = br.readLine();
		int n = s.length();
		boolean[] has = new boolean[26];
		for (int i = 0; i < n; i++)
			has[s.charAt(i) - 'a'] = true;
		int cnt = 0;
		for (int c = 0; c < 26; c++)
			if (has[c])
				cnt++;
		PrintWriter pw = new PrintWriter(System.out);
		if (cnt < k)
			pw.println("NO");
		else {
			pw.println("YES");
			int i = 0, j;
			while (k-- > 0) {
				has[s.charAt(i) - 'a'] = false;
				if (k == 0)
					j = n;
				else
					for (j = i + 1; j < n; j++)
						if (has[s.charAt(j) - 'a'])
							break;
				pw.println(s.substring(i, j));
				i = j;
			}
		}
		pw.close();
	}
}
