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;
  cin >> k;
  string q;
  cin >> q;
  char a[27];
  a[0] = q[0];
  int i, pos[27], x = 1, j, flag;
  pos[0] = 0;
  if (k != 1) {
    for (i = 1; i < q.length(); ++i) {
      flag = 0;
      for (j = 0; j < x; ++j) {
        if (q[i] == a[j]) {
          flag = 1;
          break;
        }
      }
      if (flag == 0) {
        x++;
        a[x - 1] = q[i];
        pos[x - 1] = i;
      }
      if (x == k) break;
    }
  } else if (k == 1) {
    cout << "YES" << '\n';
    cout << q;
    cout << endl;
    return 0;
  }
  if (x < k) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  for (i = 1; i <= x; ++i) {
    cout << q.substr(pos[i - 1], pos[i] - pos[i - 1]);
    cout << endl;
  }
  return 0;
}
