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.*;
import java.util.*;
public class Problem544A
{
   public static void main(String[] args)
   {
      Scanner sc = new Scanner(System.in);
      Set<Character> set = new HashSet<Character>();
      int ct = sc.nextInt();
      String str = sc.next();
      List<String> l = new ArrayList<String>();
      int ch = 0;
      set.add(str.charAt(0));
      while(set.size()<ct)
      {
         if(ct==1)
         {
            set.add(str.charAt(0));
            l.add(str);
            ct--;
            break;
         }
         if(ch==str.length()) 
            break;
         if(!set.contains(str.charAt(ch)))
         {
            set.add(str.charAt(ch));
            l.add(str.substring(0,ch));
            str=str.substring(ch);
            ch=0;
         }
         ch++;
      }
      if(set.size()==ct){
         System.out.println("YES");
         
         for(String sTemp:l)
            System.out.println(sTemp);
         if(str.length()>0) System.out.println(str);   
      }
      else System.out.println("NO");
         
   }
}