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"}.
//package codeforces;

import java.util.*;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int k= sc.nextInt(); sc.nextLine();
        String q = sc.nextLine();
        
        ArrayList<Character> distinct = new ArrayList<Character>();
        ArrayList<Integer> limites = new ArrayList<Integer>();
        for(int i=0;i<q.length();i++)
        {
            if(!distinct.contains(q.charAt(i)))
            {
                distinct.add(q.charAt(i));
                limites.add(i);
            }
        }
        if(distinct.size()<k)
            System.out.println("NO");
        else
        {
            System.out.println("YES");
            for(int i=0;i<k-1;i++)
            {
                System.out.println(q.substring(limites.get(i),limites.get(i+1)));
            }
            System.out.println(q.substring(limites.get(k-1),q.length()));
        }
    }
}

