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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
import java.sql.*;

public class Main  {
 

    public static void main(String[] args) throws FileNotFoundException {
        Scanner input=new Scanner(System.in);
        int n=input.nextInt();
        String a=input.next();
 
        Stack<String>stack=new Stack<String>();
        char []c=a.toCharArray();
        String f="",s="";
        for(int i=0;i<c.length;i++){
            s="";
            if(c[i]=='*')
                continue;
            f+=c[i];
            s+=c[i];
            for(int ii=i+1;ii<c.length;ii++){
                if(c[ii]==c[i]){
                   s+=c[ii];
                    c[ii]='*';
                }else{
                    if(f.contains(String.valueOf(c[ii]))){
                        
                        s+=c[ii];c[ii]='*';}
                    else
                    break;
                }
            }
            stack.add(s);
        }// main
        if(stack.size()<n)
            System.out.println("NO");
        else{
            System.out.println("YES");
            
            int cc=0;
            for(int i=0;i<(n-1);i++){
                cc++;
                System.out.println(stack.get(i));
            }
            for(int i=cc;i<stack.size();i++)
                System.out.print(stack.get(i));
            System.out.println();
            
        }
        
     
    
    }}