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


public class Main {
	

	public static void main(String[] args) throws IOException {

		//BufferedReader cin = new BufferedReader(new FileReader("te.txt"));
		 BufferedReader cin = new BufferedReader(new InputStreamReader(System.in));
	
		
		String line;
		StringTokenizer st;
		
		line = cin.readLine();
		st = new StringTokenizer(line);
		int n=Integer.parseInt(st.nextToken());
		//int m=Integer.parseInt(st.nextToken());
		String str = cin.readLine();
		int len = str.length();
		ArrayList<Integer> pos = new ArrayList<Integer>();
		Set<Character> set = new HashSet<Character>();
		  
		int ans;
		int t;
		char c;
		for(int i=0;i<len;i++){
			c=str.charAt(i);
			if(set.isEmpty()||!set.contains(c)){
				set.add(c);
				pos.add(i);
			}
			if(set.size()==n)break;
			
		}
		if(set.size()<n){
			System.out.println("NO");
		}
		else{
			System.out.println("YES");
			StringBuilder sb;
			pos.add(len);//add end
			for(int i=0;i<n;i++){
				sb=new StringBuilder();
				for(int j=pos.get(i);j<pos.get(i+1);j++){
					System.out.print(str.charAt(j));
				}
				System.out.println();
			}
		}
		
		
		
		cin.close();
	}

}
		 							  			 	   	 					