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;
set<char> s1;
int k, n, i, m, t;
char a;
string q, x[105];
int main() {
  cin >> k;
  cin >> q;
  n = q.size();
  if (k == 1) {
    cout << "YES" << endl << q;
    return 0;
  }
  for (i = 0; i < n; i++) {
    s1.insert(q[i]);
  }
  m = s1.size();
  if (m < k) {
    cout << "NO";
    return 0;
  }
  cout << "YES" << endl;
  s1.clear();
  cout << q[0];
  s1.insert(q[0]);
  t = s1.size();
  for (i = 1; i < n; i++) {
    s1.insert(q[i]);
    if (t < s1.size()) {
      cout << endl;
      t++;
    }
    cout << q[i];
    if (k == t) {
      q.erase(0, i + 1);
      cout << q;
      return 0;
    }
  }
}
