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.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class Sol {

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        int k = Integer.parseInt(in.readLine());
        String q = in.readLine();
        List<StringBuilder> arr = new ArrayList<>();
        in.close();
        boolean[] seen = new boolean[26];
        for (int i = 0; i < q.length(); i++) {
            if (k == 0) {
                arr.get(arr.size() - 1).append(q.substring(i));
                break;
            }
            char cur = q.charAt(i);
            if (!seen[cur - 'a']) {
                arr.add(new StringBuilder().append(cur));
                seen[cur - 'a'] = true;
                k--;
            } else {
                arr.get(arr.size() - 1).append(cur);
            }
        }
        out.println(k == 0 ? "YES" : "NO");
        if (k == 0)
            for (StringBuilder s : arr)
                out.println(s.toString());
        out.close();
    }
}
