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;
using namespace std;
int main() {
  int k;
  scanf("%d", &k);
  char str[105];
  int a[30] = {0};
  cin >> str;
  for (int i = 0; i < strlen(str); i++) {
    a[str[i] - 'a']++;
  }
  int t = 0;
  for (int i = 0; i < 30; i++) {
    if (a[i]) t++;
  }
  if (t < k) {
    cout << "NO" << endl;
    return 0;
  } else
    cout << "YES" << endl;
  int b[30];
  int z = 0;
  for (int i = 0; i < 30; i++) {
    if (a[i]) b[z++] = i;
  }
  int mark[30];
  int y = 0;
  for (int i = 0; i < z; i++) {
    for (int j = 0; j < strlen(str); j++) {
      if ((str[j] - 'a') == b[i]) {
        mark[y++] = j;
        break;
      }
    }
  }
  sort(mark, mark + y);
  mark[k] = strlen(str);
  for (int i = 0; i < k; i++) {
    for (int j = mark[i]; j < mark[i + 1]; j++) {
      cout << str[j];
    }
    cout << endl;
  }
  return 0;
}
