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.*;
public class Main {
public static void main(String args[])
{
    Scanner s=new Scanner(System.in);
    int n=s.nextInt();
    s.nextLine();
    String s1=s.nextLine();
    int counter=0;
    int []arr=new int[27];
    String []ar=new String[n+1];
    String con="";
    int p=0;
    for(int i=0;i<s1.length();i++)
    {
        int b=(int)s1.charAt(i);
        if(arr[b-96]==0)
        {
            ar[counter]=con;
            con="";
            arr[b-96]=1;
            counter++;
        }
         
         if(counter==n)
         {
             for(int j=i;j<s1.length();j++)
             {
                 con=con+s1.charAt(j);
            
             }
             ar[counter]=con;
             p=1;
             break;
         }
         else
         {
             con=con+s1.charAt(i);
         }
            
    }
    if(p==0)
    {
        System.out.println("NO");
    }
    else
    {
        System.out.println("YES");
        for(int i=1;i<=n;i++)
        {
            System.out.println(ar[i]);
        }
    }
    
}
}
