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;
  char q[100];
  scanf("%d%s", &k, q);
  int len = strlen(q);
  if (len < k) {
    printf("NO\n");
  } else {
    int st[30], n = 1;
    st[0] = 0;
    for (int i = 1; i < len; i++) {
      if (n == k) break;
      bool tag = true;
      for (int j = 0; j < n; j++) {
        if (q[i] == q[st[j]]) {
          tag = false;
          break;
        }
      }
      if (tag) st[n++] = i;
    }
    if (n == k) {
      st[n] = len;
      printf("YES\n");
      for (int i = 0; i < n; i++) {
        for (int j = st[i]; j < st[i + 1]; j++) printf("%c", q[j]);
        printf("\n");
      }
    } else
      printf("NO\n");
  }
  return 0;
}
