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.IOException;
import java.io.InputStreamReader;
import java.math.BigDecimal;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException {
        int i, j, t, ans = 0;
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        t = 1;
        while (t-- != 0) {
            int k = Integer.parseInt(br.readLine());
            String str = br.readLine();
            int[] a = new int[26];
            for (i = 0; i < 26; i++) {
                a[i] = 0;
            }
            for (i = 0; i < str.length(); i++) {
                a[str.charAt(i) - 'a'] = 1;
            }
            int sum = 0;
            for (i = 0; i < 26; i++) {
                if (a[i] > 0) {
                    sum++;
                }
            }
            if (sum < k) {
                System.out.println("NO");
            } else {
                System.out.println("YES");
                for (i = 0; i < str.length(); i++) {
                    if (k == 0) {
                        return;
                    }
                    int temp1 = i;
                    if (a[str.charAt(i) - 'a'] == 1) {
                        a[str.charAt(i) - 'a'] = 0;
                        k--;
                        StringBuilder str1 = new StringBuilder("");
                        str1.append(str.charAt(i));
                        int temp = i + 1;
                        while (temp < str.length()
                                && (str.charAt(temp) == str.charAt(i) || a[str
                                        .charAt(temp) - 'a'] == 0)) {
                            str1.append(str.charAt(temp));
                            i++;
                            temp++;
                        }
                        if (k != 0) {
                            System.out.println(str1.toString());
                        } else {
                            System.out.println(str.substring(temp1,
                                    str.length()));
                        }
                    }
                }
            }
        }
    }
}