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



public class CF_302_A {
    public static void main(String[] args) throws IOException{
        PrintWriter pw = new PrintWriter(System.out, true);
        BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
        int k = Integer.parseInt(input.readLine());
        String s = input.readLine();
        
        boolean[] check = new boolean[30];
        int last = '.', count = 0;
        StringBuilder tmp = null;
        ArrayList<String> ans = new ArrayList<String>(k);
        
        for(int i = 0 ; i < s.length() ; i++){
            if(k > count && last != s.charAt(i) && !check[s.charAt(i) - 'a']){
        
                if(tmp != null){
                    ans.add(tmp.toString());
                }
                tmp = new StringBuilder(Character.toString(s.charAt(i)));
                check[tmp.charAt(0) - 'a'] = true; 
                count++;
            }else{
                tmp.append(Character.toString(s.charAt(i)));
            }
        }
        ans.add(tmp.toString());
        
        if(count ==  k){
            pw.println("YES");
            for(String s1: ans){
                pw.println(s1);
            }
        }else{
            pw.println("NO");
        }
        
        pw.close();
        input.close();
    }
}
