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.InputStreamReader;
import java.util.*;
import java.io.PrintWriter;
public class TestClass1 {
    public static void main(String args[] ) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(System.out);

        int k = Integer.parseInt(br.readLine());
       

        String s= br.readLine();
        boolean[] fre = new boolean[26];

        ArrayList<Character> al = new ArrayList<Character>(26);

        for(int i=0;i<s.length();i++){
            fre[s.charAt(i)-'a']=true;
        }

        int count=0;
        boolean flag=true;
        for(int i=0;i<26;i++){
            if(fre[i]){
                count++;
                if(count==k){
                    flag = false;
                    break;
                }
            }
        }
        count=1;
        if(flag){
            System.out.println("NO");
        }else{
            System.out.println("YES");
            char b=s.charAt(0);
            al.add(b);

            String a=s.charAt(0)+"";
            for(int i=1;i<s.length();i++){

                if(count==k){
                    count=i;
                        break;
                    }

                if(al.contains(s.charAt(i))){
                    a+=s.charAt(i)+"";
                }else{
                    
                    System.out.println(a);
                    a="";
                    count++;
                    a=s.charAt(i)+"";
                    al.add(s.charAt(i));
                    if(count==k && i==s.length()-1){
                        count=i+1;
                        break;
                    }
                    

                }
            }
            for(int j=count;j<s.length();j++){
                        a+=s.charAt(j)+"";
                    }System.out.println(a);
        }

    }    
}
