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 q[110];
int k;
int pos[26], num = 0;
int main() {
  cin >> k >> q;
  int len = strlen(q);
  for (int i = 0; i < 26; i++) pos[i] = 1000;
  for (int i = 0; i < len; i++) {
    if (pos[q[i] - 'a'] == 1000) pos[q[i] - 'a'] = i, num++;
  }
  sort(pos + 0, pos + 26);
  if (num < k)
    printf("NO\n");
  else {
    printf("YES\n");
    for (int i = 0; i < k - 1; i++) {
      for (int j = pos[i]; j < pos[i + 1]; j++) {
        printf("%c", q[j]);
      }
      printf("\n");
    }
    for (int j = pos[k - 1]; j < len; j++) printf("%c", q[j]);
    printf("\n");
  }
  return 0;
}
