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.FileReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.BufferedOutputStream;
import java.util.StringTokenizer;

public class SetOfStrings {

	private static final FastScanner scanner = new FastScanner();
	private static final PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

	public static void main(String[] args) {
		int k;
		String q;
		boolean[] used = new boolean[26];

		k = scanner.nextInt();
		q = scanner.nextToken();

		if (k > q.length()) {
			out.print("NO");
		} else if (q.length() == 1) {
			out.println("YES");
			out.print(q);
		} else {
			String[] results = new String[k];

			int i, l = 0, j = 0, len = q.length();
			char ic, c;

			for (i = 0; i < k; i++) {
				ic = q.charAt(j);
				while (j < len && ((c = q.charAt(j)) == ic || used[c - 97])) {
					j++;
				}
				results[i] = q.substring(l, j);
				used[ic - 97] = true;
				l = j;
				if (j == len) break;
			}

			if (i < k - 1) {
				out.print("NO");
			} else {
				if (j < len)
					results[results.length - 1] += q.substring(j);
				out.println("YES");
				for (i = 0; i < results.length; i++)
					out.println(results[i]);
			}
		}

		out.close();
	}


	public static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(String s) {
            try {
                br = new BufferedReader(new FileReader(s));
            } catch (FileNotFoundException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
        }

        public FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String nextToken() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    // TODO Auto-generated catch block
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(nextToken());
        }

        long nextLong() {
            return Long.parseLong(nextToken());
        }

        double nextDouble() {
            return Double.parseDouble(nextToken());
        }
    }
}