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.*;
import java.math.*;

public class CF544A
{
	int k;
	String str;
	boolean[] vis=new boolean[30];
	int[] left=new int[30];
	int[] right=new int[30];

	CF544A()
	{
		Scanner in = new Scanner(System.in);
		k=in.nextInt();
		str=in.next()+(char)('z'+1);
		
		int tp=0;
		left[tp]=0;
		vis[str.charAt(0)-'a']=true;
		for(int i=1,sz=str.length();i<sz;i++)
		{
			int c=str.charAt(i)-'a';
			if(vis[c]==false)
			{
				vis[c]=true;
				right[tp]=i-1;
				tp++;
				left[tp]=i;
			}
		}
		if(tp>=k)
		{
			System.out.println("YES");
			right[k-1]=str.length()-2;
			for(int i=0;i<k;i++)
			{
				for(int j=left[i];j<=right[i];j++)
				{
					System.out.printf("%c",str.charAt(j));
				}
				System.out.println("");
			}
		}
		else
		{
			System.out.println("NO");
		}
	}

	public static void main(String[] args)
	{
		new CF544A();
	}
}
