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"}.
#include <bits/stdc++.h>
using namespace std;
int main() {
  int k, i, l = 0;
  string str;
  map<char, int> ch;
  int a[30];
  bool ind = false;
  cin >> k;
  cin >> str;
  int n = str.size();
  ch[str[0]] = 1;
  a[0] = 1;
  a[1] = 0;
  for (i = 0; i < n; i++) {
    if (ch[str[i]] == 0) {
      a[0]++;
      a[a[0]] = i;
      ch[str[i]] = 1;
    }
    if (a[0] == k) {
      ind = true;
      i = n + 2;
    }
  }
  if (!ind)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (i = 1; i < a[0]; i++) {
      for (int j = a[i]; j < a[i + 1]; j++) cout << str[j];
      cout << endl;
    }
    for (i = a[a[0]]; i < n; i++) cout << str[i];
    cout << endl;
  }
  return 0;
}
