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 A {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int K = in.nextInt();
        String str = in.next();
        Map<Character, Integer> starts = new HashMap<Character, Integer>();
        for (int i = 0; i < str.length(); i++) {
            char ch = str.charAt(i);
            if(!starts.containsKey(ch)) {
                starts.put(ch, i);
            }
        }

        if(starts.size() < K) {
            System.out.println("NO");
        } else {
            System.out.println("YES");
            if(K == 1) {
                System.out.println(str);
            } else {
                List<Integer> arr = new ArrayList<Integer>(starts.values());
                Collections.sort(arr);
//                System.out.println(arr);
                int i;
                for (i = 0; i < Math.min(K, arr.size()) - 1; i++) {
                    int start = arr.get(i);
                    int end = arr.get(i + 1);
                    System.out.println(str.substring(start, end));
                }
                if(i != Math.min(K, arr.size())) {
                    System.out.println(str.substring(arr.get(i)));
                }
            }
        }
    }
}
