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.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Main {

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

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int k = Integer.parseInt(br.readLine());

        String line = br.readLine();

        int[] table = new int[256];

        char[] lineArray = line.toCharArray();

        int countOfStrings = 0;
        int firstIndex = 0;
        int nextDifferent = 0;
        ArrayList<String> strings = new ArrayList<String>();

        for (int i = 0; i < lineArray.length; i++) {
            if (table[lineArray[i]] == 0) {
                table[lineArray[i]]++;
                if (countOfStrings + 1 == k) {
                    strings.add(line.substring(i));
                } else {
                    for (int j = i; j < lineArray.length; j++) {
                        if (table[lineArray[j]] == 0) {
                            strings.add(line.substring(i, j));
                            i = j - 1;
                            break;
                        }
                    }
                }
                countOfStrings++;
                if (countOfStrings == k) break;
            } else {
                nextDifferent = i + 1;
            }
        }

        if (countOfStrings == k) {
            System.out.println("YES");
            for (String s : strings) {
                System.out.println(s);
            }
        } else {
            System.out.println("NO");
        }


    }
}
