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

/**
 * Created by Kristian on 5/29/2015.
 */
public class CodeForces544A {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        String word = s.next();
        if(n==1){
            System.out.println("YES");
            System.out.println(word);
            return;
        }
        HashSet<Character> set = new HashSet<Character>();
        ArrayList<Integer> indices = new ArrayList<Integer>();
        for (int i = 0; i < word.length(); i++) {
            char c = word.charAt(i);
            if(!set.contains(c)){
                set.add(word.charAt(i));
                indices.add(i);
            }
        }
        if(indices.size() < n){
            System.out.println("NO");
            return;
        }
        ArrayList<String> list = new ArrayList<String>();
        list.add(word.substring(0,indices.get(1)));
        for (int i = 1; i < n-1; i++) {
            list.add(word.substring(indices.get(i),indices.get(i+1)));
        }
        list.add(word.substring(indices.get(n-1)));
        System.out.println("YES");
        for (String s1 : list) {
            System.out.println(s1);
        }
    }
}
