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.*;

/**
 * Created by 优华 on 5/19/2015.
 */
public class Set_of_Strings {
    public static void main(String[] args){
       Scanner in = new Scanner(System.in);
        int k = in.nextInt();
        String inputString = in.next();
        char[] charArray = inputString.toCharArray();
        HashMap<Character,Integer> charMap = new HashMap<Character,Integer>();

        for(int i = charArray.length-1 ; i >=0; i --){
            charMap.put(charArray[i],i);
        }
        if(k > charMap.size()){
            System.out.println("NO");
        }else{
            System.out.println("YES");
            Collection<Integer> indexCollection= charMap.values();
           Integer[] indexArray  =indexCollection.toArray(new Integer[1]);
            Arrays.sort(indexArray);
            int indexMark= indexArray[0];
            for(int i = 0; i < charArray.length;i++ ){
                if(k > 0 && i == indexArray[indexMark]) {
                    if (i > 0) {
                        System.out.print('\n');
                    }
                    k--;
                    indexMark++;
                }
                System.out.print(charArray[i]);
            }
            System.out.print("\n");

        }
    }
}