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, u = 0, i;
  vector<char> m;
  vector<int> pos;
  cin >> k;
  string ch;
  cin >> ch;
  if (k == 1) {
    cout << "YES\n" << ch << endl;
    return 0;
  } else if (k > ch.size()) {
    cout << "NO" << endl;
    return 0;
  }
  m.push_back(ch[0]);
  pos.push_back(0);
  u++;
  for (int i = 1; i < ch.size(); i++) {
    if (find(m.begin(), m.end(), ch[i]) == m.end()) {
      m.push_back(ch[i]);
      pos.push_back(i);
      u++;
    }
    if (u >= k) break;
  }
  if (u < k)
    cout << "NO" << endl;
  else {
    cout << "YES\n";
    int y = pos.size();
    for (i = 0; i < k - 1; i++) {
      for (int j = pos[i]; j < pos[i + 1]; j++) {
        cout << ch[j];
      }
      cout << endl;
    }
    for (int j = pos[k - 1]; j < ch.size(); j++) {
      cout << ch[j];
    }
    cout << endl;
  }
  return 0;
}
