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>
int lis[1000000], lis1[1000000];
using namespace std;
int main() {
  int a, n, i, j;
  int lis[27] = {0};
  int k;
  char str[100000];
  int lis1[100];
  cin >> k;
  cin >> str;
  int l = strlen(str);
  if (l < k) {
    cout << "NO";
    return 0;
  }
  int p = 0;
  for (int i = 0; i < l; i++) {
    if (lis[str[i] - 'a'] == 0) {
      lis1[p] = i;
      p++;
      lis[str[i] - 'a'] = 1;
    }
  }
  if (p < k) {
    cout << "NO";
    return 0;
  }
  cout << "YES\n";
  for (i = 0; i < k - 1; i++) {
    p = lis1[i];
    for (a = p; a <= lis1[i + 1] - 1; a++) cout << str[a];
    cout << endl;
  }
  for (i = lis1[i]; i < l; i++) cout << str[i];
  return 0;
}
