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, i, j;
  char q[103];
  int fr[255], indx[103], ndx = 0;
  for (i = 0; i < 200; i++) fr[i] = 0;
  cin >> k;
  cin >> q;
  for (i = 0; i < strlen(q); i++)
    if (ndx < k && (!fr[((int)q[i])])) {
      fr[((int)q[i])] = 1;
      indx[++ndx] = i;
    }
  if (ndx == k) {
    cout << "YES\n";
    for (i = 1; i <= ndx - 1; i++) {
      for (j = indx[i]; j < indx[i + 1]; j++) cout << q[j];
      cout << "\n";
    }
    for (j = indx[ndx]; j < strlen(q); j++) cout << q[j];
  } else
    cout << "NO";
  return 0;
}
