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.Scanner;
/**
 * @author Alvex - GoldenReam1503@gmail.com
 * Time: 12:24:26 PM
 * Date: Oct 30, 2015
 */
public class _544A_Set_of_Strings
{
    public static boolean isNotContains(String s, char k)
    {
        int i;
        for (i=0;i<s.length();i++)
            if (s.charAt(i)==k)
                return false;
        return true;
    }
    public static void main(String[] args)
    {
        Scanner input = new Scanner (System.in);
        int n=input.nextInt();
        String q=input.next();
        int l=q.length();
        int i,d=0,t=0,f=0;
        String s="";
        int index[]=new int[124];
        for (i=0;i<l;i++)
            index[(int)q.charAt(i)]++;
        for (i=97;i<=122;i++)
            if (index[i]!=0)
                d++;
        if(d>=n)
        {   
            System.out.println("YES");
            while(f<n)
            {
                if (isNotContains(s,q.charAt(t)))
                {
                    int j=0;
                    s+=q.charAt(t);
                    for (i=t+1;i<l;i++)
                        if(isNotContains(s,q.charAt(i)))
                        {
                            j=i;
                            break;
                        }
                    if(f+1==n)
                    {
                        for (i=t;i<l;i++)
                            System.out.print(q.charAt(i));
                        break;
                    }
                    else
                    {
                        for (i=t;i<j;i++)
                            System.out.print(q.charAt(i));
                        System.out.println();
                        f++;
                        t=j;
                    }
                }
            }
        }
        else
            System.out.println("NO");
//      System.out.println();
//      System.out.println(s);
        input.close();
    }
}
