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.HashMap;
import java.util.Scanner;

public class SetOFStrings {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int k=s.nextInt();
		String q=s.next();
		int count=0;
		HashMap<Character, Boolean> map=new HashMap<Character, Boolean>();
		for(int i=0;i<q.length();i++) {
			if(map.containsKey(q.charAt(i))) {
				continue;
			}
			else {
				map.put(q.charAt(i), true);
				count++;
			}
		}
		if(count>=k) {
			int temp=0;
			int pos=-1;
			HashMap<Character, Boolean> map1 = new HashMap<Character, Boolean>();
			System.out.print("YES");
			for(int i=0;i<q.length();i++) {
				if(!map1.containsKey(q.charAt(i))) {
					System.out.println();
					System.out.print(q.charAt(i));
					map1.put(q.charAt(i), true);
					temp++;
					pos=i;
				} else {
					System.out.print(q.charAt(i));
				}
				if(temp>=k) {
					break;
				}
			}
			for(int i=pos+1;i<q.length();i++) {
				System.out.print(q.charAt(i));
			}
		} else {
			System.out.println("NO");
		}
	}
}
