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"}.
//package setOfStrings;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.TreeSet;

public class SetOfStrings {

	public static void main(String[] args) {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int k = 0;

		String q = null;
		try {

			k = Integer.parseInt(br.readLine());
			q = br.readLine();
		} catch (Exception e) {
			System.out.println(e.getMessage());
			return;
		}

		LinkedList<String> wordList = new LinkedList<String>();
		TreeSet<Character> firstCharacters = new TreeSet<Character>();
		String tek = q.substring(0, 1);
		firstCharacters.add(q.charAt(0));
		int ind = 1;
		while (true) {
			
			if (wordList.size() + 1 == k) {
				tek += q.substring(ind, q.length());
				break;
			}

			if (ind == q.length()) {
				break;
			}

			if (firstCharacters.contains(q.charAt(ind))) {
				tek += String.valueOf(q.charAt(ind));
			} else {
				wordList.add(tek);
				tek = String.valueOf(q.charAt(ind));
				firstCharacters.add(q.charAt(ind));
			}
			ind++;
		}

		wordList.add(tek);
		if (wordList.size() == k) {
			System.out.println("YES");
			for (String w : wordList) {
				System.out.println(w);
			}
		} else {
			System.out.println("NO");
		}
	}
}
