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;
bool check(char s, string *temp, int ctr) {
  string tmp = "";
  for (int i = 0; i <= ctr; i++) {
    tmp = temp[i];
    if (tmp[0] == s) return false;
  }
  return true;
}
int main() {
  int n;
  cin >> n;
  string q;
  cin >> q;
  int index = 0;
  int ctr = 0;
  string temp[n];
  temp[0] = q[0];
  if (ctr == n - 1) {
    cout << "YES" << endl;
    cout << q;
    return 0;
  }
  for (int i = 1; i < q.size(); i++) {
    if (ctr == n - 1) {
      for (int j = i; j < q.size(); j++) {
        temp[ctr] += q[j];
      }
      cout << "YES" << endl;
      for (int j = 0; j < n; j++) {
        cout << temp[j] << endl;
      }
      return 0;
    }
    if (check(q[i], temp, ctr)) {
      ctr++;
      temp[ctr] = q[i];
    } else {
      temp[ctr] += q[i];
    }
  }
  if (ctr == n - 1) {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) cout << temp[i] << endl;
    return 0;
  }
  cout << "NO";
  return 0;
}
