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

public class Main
{  
    public static void main(String[] args) throws IOException 
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int n = Integer.parseInt(st.nextToken());//, k = Integer.parseInt(st.nextToken());
        String str = br.readLine();
        boolean[] char_exst = new boolean[26];
        int cnt = 0;
        StringBuilder ans = new StringBuilder();
        
        for(int i=0; i<str.length(); i++)
        {
            int sv = i;
            while(i+1 < str.length() && (str.charAt(i+1) == str.charAt(sv) || char_exst[str.charAt(i+1) - 'a'])) 
                i++;
                
            char_exst[str.charAt(sv) - 'a'] = true;
            cnt++;
            
            if(cnt >= n)
            {
                ans.append(str.substring(sv));
                break;
            }
            else ans.append(str.substring(sv,i+1) + "\n");
        }

        if(cnt < n) System.out.println("NO");
        else System.out.println("YES\n" + ans);
    }
}