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;
char a[105];
int aa[28] = {0};
int main() {
  int n;
  cin >> n;
  cin >> a;
  if (strlen(a) < n) {
    cout << "NO";
    return 0;
  } else {
    for (int i = 0; i < 27; ++i) {
      aa[i] = strlen(a);
    }
    int h = 0;
    h = 1;
    aa[0] = 0;
    for (int i = 0; i <= strlen(a); ++i) {
      int jj = 0;
      if (h < n) {
        for (int j = 0; j < h; ++j) {
          if (a[i] == a[aa[j]]) {
            jj = 1;
          }
        }
        if (jj == 0) {
          aa[h] = i;
          h++;
        }
      } else {
        cout << "YES" << endl;
        for (int p = 0; p < n; ++p) {
          for (int hh = aa[p]; hh < aa[p + 1]; hh++) {
            cout << a[hh];
          }
          cout << endl;
        }
        return 0;
      }
    }
  }
  cout << "NO";
  return 0;
}
