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 flag[26], breakpoint[101];
int main() {
  int i, n, pos[101], j = 0, k;
  char a[101];
  cin >> k >> a;
  if (k > strlen(a)) {
    cout << "NO\n";
    return 0;
  }
  if (k == 1) {
    cout << "YES\n" << a << "\n";
    return 0;
  }
  for (i = 0; i < strlen(a); i++) {
    n = (int)a[i] - 97;
    if (flag[n] == 0) {
      flag[n] = 1;
      j++;
      if (j > 1) {
        breakpoint[i] = 1;
      }
    }
    if (k == j) break;
  }
  if (k == j) {
    cout << "YES\n";
    for (i = 0; i < strlen(a); i++) {
      if (breakpoint[i] == 1) cout << "\n";
      cout << a[i];
    }
  } else {
    cout << "NO";
  }
  cout << "\n";
  return 0;
}
