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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author atanasova
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, Scanner in, PrintWriter out) {

            int Q = in.nextInt();
            String s = in.next();

            int[] cnt = new int[26];

            ArrayList<Integer> ar = new ArrayList<>();
            for (int i = 0; i < s.length(); ++i) {
                int id = (s.charAt(i) - 'a');
                if (cnt[id] == 0) {
                    ar.add(i);
                    --Q;
                    cnt[id]++;
                }
                if (Q == 0) break;
            }
            if (Q > 0) {
                out.println("NO");
                return;
            } else {
                out.println("YES");
                String ret = "";
                ret += s.charAt(0);
                for (int i = 1; i < s.length(); ++i) {
                    if (ar.contains(i)) {
                        out.println(ret);
                        ret = s.charAt(i) + "";
                    } else ret += s.charAt(i);
                }
                out.println(ret);
            }

        }

    }
}

