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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.Reader;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class A 
{
    public static void main(String[] args)
    {
        Scanner s = new Scanner();
        int n = s.nextInt();
        String str = s.next();
        
        boolean[] chars = new boolean[26];
        ArrayList<Integer> starts = new ArrayList<Integer>();
        int count = 0;
        for (int i = 0; i< str.length(); i++)
        {
            if (chars[str.charAt(i) - 'a'] == false)
            {
                chars[str.charAt(i) - 'a'] = true;
                count++;
                starts.add(i);
            }
            
        }
        if (count < n)
        {
            System.out.println("NO");
            System.exit(0);
        }
        System.out.println("YES");
        
        StringBuffer sb = new StringBuffer();
        int i = 0;
        for (; i < n -1; i++)
        {
            sb.append(str.substring(starts.get(i), starts.get(i + 1)) + "\n");
        }
        sb.append(str.substring(starts.get(i)) + "\n");
        System.out.println(sb.toString());
    }
    
    public static class Scanner {
        BufferedReader br;
        StringTokenizer st;

        public Scanner(Reader in) {
            br = new BufferedReader(in);
        }

        public Scanner() {
            this(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        // Slightly different from java.util.Scanner.nextLine(),
        // which returns any remaining characters in current line,
        // if any.
        String readNextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        public int[] readNextLineInts(int numberOfInts) {
            int[] ints = new int[numberOfInts];
            for (int i = 0; i < numberOfInts; i++)
                ints[i] = nextInt();
            return ints;
        }
        
        public double[] readNextLineDoubles(int numberOfDoubles) {
            double[] doubles = new double[numberOfDoubles];
            for (int i = 0; i < numberOfDoubles; i++)
                doubles[i] = nextDouble();
            return doubles;
        }
        // --------------------------------------------------------
    }

}
