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

public class Main {

    public static void main(String ads[]) {
        Scanner sc = new Scanner(System.in);
        int k = sc.nextInt();
        sc.nextLine();
        String q = sc.nextLine();

        String[] list = new String[k];
        int pos = 0;
        boolean[] is_ = new boolean[256];

        int old = 0;
        int i = 1;
        is_[q.charAt(0)] = true;
        for (; i < q.length(); i++) {
            if (k == 1) {
                list[pos++] = q.substring(old);
                k = 0;
                break;
            }
            char ch = q.charAt(i);
            if (!is_[ch]) {
                is_[ch] = true;
                list[pos++] = q.substring(old, i);
                old = i;
                k--;
            }
        }
        if (k == 1) {
            if (pos < list.length) {
                list[pos++] = q.substring(old);
                k = 0;
            }
        }
        if (k == 0) {
            System.out.println("YES");
            for (i = 0; i < list.length; i++) {
                System.out.println(list[i]);
            }
        } else {
            System.out.println("NO");
        }
    }
}
