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.*;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = Integer.parseInt(scanner.nextLine());
        String input = scanner.nextLine();
        
        String[] strings = getPieces(n, input);
        if(strings != null) {
            System.out.println("YES");
            for(int i=0; i<strings.length; i++) {
                System.out.println(strings[i]);
            }
        } else {
            System.out.println("NO");
        }
    }
    public static String[] getPieces(int n, String input) {
        List<Character> used = new ArrayList<Character>();
        String[] strings = new String[n];
        int pos = 0;
        for(int i=0; i<n-1; i++) {
            int oldpos = pos;
            char a = input.charAt(pos++);
            used.add(a);
            if(pos>=input.length()) {
                    return null;
            }
            while(used.contains(input.charAt(pos))) {
                pos++;
                if(pos>=input.length()) {
                    return null;
                }
            }
            strings[i] = input.substring(oldpos, pos);
        }
        if(pos>=input.length()) {
            return null;
        } else {
            strings[n-1] = input.substring(pos);
        }
        return strings;
    }
}

		   	    		  	 	 	 					  				