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.util.ArrayList;


public class SetOfStrings {

    public static void main(String[] args) throws NumberFormatException, IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int k = Integer.parseInt(br.readLine());
        String q = br.readLine();

        ArrayList<Character> used = new ArrayList<Character>();
        ArrayList<String> ans = new ArrayList<String>();
        String curString = q.charAt(0) + "";
        used.add(q.charAt(0));

        for (int i = 1; i < q.length(); i++) {
            if (used.contains(q.charAt(i)))
                curString += q.charAt(i);
            else {
                ans.add(curString);
                used.add(curString.charAt(0));
                curString = q.charAt(i) + "";
                used.add(q.charAt(i));
            }
        }   
        if (!curString.isEmpty())
            ans.add(curString);

        if (ans.size() > k){
            String accumulator = "";

            for (int i = ans.size()-1-(ans.size()-k); i < ans.size(); i++) {
                accumulator += ans.get(i);
                ans.remove(i);
                i--;
            }
            ans.add(accumulator);
            System.out.println("YES");
            for (int i = 0; i < ans.size(); i++) 
                System.out.println(ans.get(i));
        }
        else if (ans.size() < k)
            System.out.println("NO");
        else {
            System.out.println("YES");
            for (int i = 0; i < ans.size(); i++) 
                System.out.println(ans.get(i));
        }
    }

}
