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() {
  bool used[26] = {0}, counter[26] = {0};
  int k, length, diff_letters = 0;
  string q;
  scanf("%d", &k);
  cin >> q;
  length = q.length();
  for (int i = 0; i < length; ++i) {
    if (counter[q[i] - 'a'] == 0) {
      diff_letters++;
      counter[q[i] - 'a'] = 1;
    }
  }
  if (diff_letters < k) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
    cout << q[0];
    used[q[0] - 'a'] = 1;
    k--;
    int i;
    for (i = 1; i < length; ++i) {
      if (k == 0) break;
      if (used[q[i] - 'a'])
        cout << q[i];
      else {
        cout << endl;
        cout << q[i];
        k--;
        used[q[i] - 'a'] = 1;
      }
    }
    while (i < length) {
      cout << q[i];
      i++;
    }
    cout << endl;
  }
}
