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.InputStreamReader;
import java.io.InputStream;
import java.io.BufferedReader;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.Arrays;

public class TaskA {
  public static void main(String[] args) {
    InputReader in = new InputReader(System.in);
    solve(in);
  }
  
  public static void solve(InputReader in) {
    int k = in.nextInt();
    boolean[] selected = new boolean[26];
    char[] q = in.next().toCharArray();
    int count = 0;
    for (int i = 0; i < q.length; i++) {
      if (!selected[q[i] - 'a']) {
        count++;
        selected[q[i] - 'a'] = true;
      }
    }
    if (count < k) {
      System.out.println("NO");
      return;
    }
    String[] s = new String[k];
    Arrays.fill(s, "");
    Arrays.fill(selected, false);
    int index = -1;
    int stop = 0;
    for (int i = 0; i < q.length; i++) {

      if (!selected[q[i] - 'a']) {
        selected[q[i] - 'a'] = true;
        index++;
        if (index == k - 1) {
          stop = i;
          break;
        }
      }
      s[index] += q[i];
    }
    for (int i = stop; i < q.length; i++)
      s[k - 1] += q[i];
    System.out.println("YES");
    for (int i = 0; i < k; i++)
      System.out.println(s[i]);
  }
}
      
      
      
      
    

class InputReader {
  public BufferedReader reader;
  public StringTokenizer tokenizer;
  
  public InputReader(InputStream stream) {
    reader = new BufferedReader(new InputStreamReader(stream), 32678);
    tokenizer = null;
  }
  
  public String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new StringTokenizer(reader.readLine());
      } catch (IOException e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }
  
  public String nextLine() {
    String str = "";
    try {
      str = reader.readLine();
    } catch (IOException e) {
      throw new RuntimeException(e);
    }
    return str;
  }
  
  public int nextInt() {
    return Integer.parseInt(next());
  }
  
  public long nextLong() {
    return Long.parseLong(next());
  }
  
  public double nextDouble() {
    return Double.parseDouble(next());
  }
}

    
    