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"}.
/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		Scanner S=new Scanner(System.in);
		int k;
		k=S.nextInt();
		String s1=S.next();
		String s2="";
		s2=s2+s1.charAt(0);
		int c=1,start=-1;
		String ans="";
		for(int i=1;i<s1.length();i++)
		{
			if (c==k) {
				break;
			}
			if (c<k)
			{
				if (s2.indexOf(s1.charAt(i))==-1) 
				{
					c++;
					s2=s2+s1.charAt(i);
					if (start!=-1) ans=ans+"\n"+s1.substring(start,i);
					else ans=s1.substring(start+1,i);
					start=i;
				}
			}
		}
		if (start!=-1) ans=ans+"\n"+s1.substring(start);
		else ans=s1.substring(start+1);
		if (c<k) System.out.println("NO");
		else System.out.println("YES\n"+ans);
	}
}