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.HashMap;
import java.util.Scanner;


public class SetOfSttrings {
    public static void main(String[] args) {
        Scanner scn = new Scanner(System.in);
        HashMap<Character, Integer> charMap = new HashMap<Character, Integer>();

        int n = scn.nextInt();
        String str = scn.next();

        int[] arr = new int[str.length()];
        for (int i = 0; i < str.length(); i++) {
            if(!charMap.containsKey(str.charAt(i)))
            {
                charMap.put(str.charAt(i), i);
                arr[i] = 1;
            }
        }

        if(charMap.size() >= n)
        {
            System.out.println("YES");

            int sidx = 0;
            for (int i = 0; i < n; i++) {
                if(i == n-1)
                {
                    System.out.println(str.substring(sidx, str.length()));
                }
                else
                {
                    StringBuilder sb = new StringBuilder("");

                    sb.append(str.charAt(sidx));
                    sidx++;

                    while(arr[sidx] != 1)
                    {
                        sb.append(str.charAt(sidx));
                        sidx++;
                    }

                    System.out.println(sb);
                }
            }
        }
        else
            System.out.println("NO");

    }
}
