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

/**
 * Created by Zhenyi Luo on 15-5-10.
 */
public class A {
    public void solve(Scanner sc, PrintWriter pw){
        int k = sc.nextInt();
        String q = sc.next();
        ArrayList<String> ans = new ArrayList<String>();
        boolean[] mask = new boolean[26];
        int index = 0;
        while(k > 0){
            if(index >= q.length()){
                pw.println("NO");
                return;
            }
            if(k == 1){
                ans.add(q.substring(index));
            }else{
                mask[q.charAt(index) - 'a'] = true;
                int end = index;
                while(end + 1 < q.length() && mask[q.charAt(end+1) - 'a']){
                    end++;
                }
                ans.add(q.substring(index, end + 1));
                index = end + 1;
            }
            k--;
        }
        pw.println("YES");
        for(int i = 0; i < ans.size(); i++){
            pw.println(ans.get(i));
        }
    }

    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        new A().solve(sc, pw);
        pw.flush();
        pw.close();
        sc.close();
    }
}
