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.*;
import java.io.*;


public class A implements Runnable {
		
	public void solve() throws IOException {
		int N = nextInt();
                char[] c = nextToken().toCharArray();
                ArrayList<String> ans = new ArrayList<String>();
                
                boolean[] used = new boolean[26];
                StringBuilder sb = new StringBuilder();
                for(int i = 0; i < c.length; i++){
                    if(i == 0) sb.append(c[i]);
                    else if(c[i] == c[i-1]) sb.append(c[i]);
                    else{
                        ans.add(sb.toString());
                        sb = new StringBuilder();
                        sb.append(c[i]);
                    }
                }
                ans.add(sb.toString());
                
               
                
                String[] answer = new String[N];
                Arrays.fill(answer, "");
                
                answer[0] = ans.get(0);
                used[ans.get(0).charAt(0) - 'a'] = true;
                int index = 0;
                for(int i = 1; i < ans.size(); i++){
                    if(used[ans.get(i).charAt(0) - 'a'] || index + 1 >= N) answer[index] += ans.get(i);
                    else{ index++; answer[index] += ans.get(i); used[ans.get(i).charAt(0) -'a'] = true; }
                }
                
                if(answer[N-1].length() != 0){
                    out.println("YES");
                    for(String s : answer)
                        out.println(s);
                }
                else{
                    out.println("NO");
                }
                
	}

	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	//-----------------------------------------------------------
	public static void main(String[] args) {
		new A().run();
	}

        public void debug(Object... arr){
            System.out.println(Arrays.deepToString(arr));
        }

        public void print1Int(int[] a){
                for(int i = 0; i < a.length; i++)
                        System.out.print(a[i] + " ");
                System.out.println();
        }
        
        public void print2Int(int[][] a){
                for(int i = 0; i < a.length; i++){
                        for(int j = 0; j < a[0].length; j++){
                                System.out.print(a[i][j] + " ");
                        }
                        System.out.println();
                }
        }
        
	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
                        out = new PrintWriter(System.out);
			tok = null;
			solve();
			in.close();
                        out.close();
		} catch (IOException e) {
			System.exit(0);
		}
	}

	public String nextToken() throws IOException {
		while (tok == null || !tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}

	public int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	public long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	public double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
        PrintWriter out;
	BufferedReader in;
	StringTokenizer tok;
}