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"}.
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 *
 * @author Mbt925
 */
public class Main {

    /**
     * @param args the command line arguments
     * @throws java.io.FileNotFoundException
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        new Solve().solve();
    }
}

class Solve {
    public void solve() throws FileNotFoundException, IOException{
        BufferedReader reader= new BufferedReader(new InputStreamReader(System.in));
//        BufferedReader reader= new BufferedReader(new BufferedReader(new FileReader("d:\\B.in")));
        PrintWriter writer= new PrintWriter(new BufferedOutputStream(System.out));
//        PrintWriter writer= new PrintWriter(new BufferedWriter(new FileWriter("d:\\B.out")));
        
//        int t= Integer.parseInt(reader.readLine());        
        int t=1;
        for (int i = 0; i < t; i++) {
            int k= Integer.parseInt(reader.readLine());
            String q= reader.readLine();
            
            if (k>q.length()) {
                writer.println("NO");    
            } else {
                int[] positions= new int[k-1];
                String chars="";
                int nParts= 0;
                for (int j = 0; j < q.length(); j++) {
                    if (chars.indexOf(q.charAt(j))==-1) {
                        chars= chars + String.valueOf(q.charAt(j));
                        if (nParts>0) positions[nParts-1]= j;
                        nParts++;
                        if (nParts==k) break;
                    }
                }
                if (nParts==k) {
                    writer.println("YES");
                    int lastBeginIndex=0;
                    for (int j = 0; j < positions.length; j++) {
                        writer.println(q.substring(lastBeginIndex, positions[j]));
                        lastBeginIndex= positions[j];
                    }
                    writer.println(q.substring(lastBeginIndex, q.length()));
                } else {
                    writer.println("NO");
                }
            }
        }
        
        writer.flush();
        writer.close();
        reader.close();
    }
}
