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.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;


public class B1 {
    public static void main(String[] args) {
        Scanner sc =new Scanner (System.in);
        int n=sc.nextInt();
        String s=sc.next();
        HashMap<Character, Integer>m=new HashMap<Character, Integer>();
        for (int i=0;i<s.length();i++){
            if (!m.containsKey(s.charAt(i)))
            m.put(s.charAt(i),i);
            if (m.size()==n)break;
        }
    //  System.out.println(m);
        if (m.size()<n){
            System.out.println("NO");
        }
        else{
            StringBuilder b=new StringBuilder();
            b.append("YES\n");
            int a[]=new int [m.size()+1];
            int c=0;
            for (Map.Entry<Character, Integer>v:m.entrySet()){
                a[c++]=v.getValue();
            }
            a[c]=s.length();
            Arrays.sort(a);
            for (int i=0;i<a.length-1;i++){
                b.append(s.substring(a[i],a[i+1])+"\n");
            }
            System.out.print(b);
        }
        
    }

}
