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.*;
import java.io.*;
public class Solution{

	public void run() throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));

		int n = Integer.parseInt(br.readLine().trim());
		char [] arr = br.readLine().trim().toCharArray();

		boolean [] temp = new boolean[26];
		int count = 0;
		List<Integer> list = new ArrayList<Integer>();

		for(int i=0;i<arr.length;i++){
			if(temp[arr[i]-'a'])
				continue;
			temp[arr[i]-'a']=true; 
			count++;
			list.add(i);
			if(count==n)
				break;
		}

		if(count>=n){
			out.println("YES");
			int size = list.size();
			for(int i=0;i<size-1;i++){
				int s = list.get(i);
				int e = list.get(i+1);
				for(int j=s;j<e;j++)
					out.print(arr[j]);
				out.println();
			}
			int s = list.get(size-1);
			for(int i=s;i<arr.length;i++)
				out.print(arr[i]);
			out.flush();
			out.close();
			br.close();
			return;
		}
		out.println("NO");
		out.flush();
		out.close();
		br.close();
	}
	
	public static void main(String [] args) throws IOException{
		new Solution().run();
	}
}