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(void) {
  int k, i, lenq, j, c, z;
  char q[1001], x[1001];
  while (scanf("%d %s", &k, q) == 2) {
    lenq = strlen(q);
    x[0] = q[0];
    c = 1;
    for (i = 1; i < lenq; i++) {
      for (j = 0; j < c; j++) {
        if (q[i] == x[j]) break;
      }
      if (j == c) {
        x[c] = q[i];
        c++;
      }
    }
    z = 0;
    if (c >= k) {
      printf("YES\n");
      for (i = 0; i < lenq; i++) {
        printf("%c", q[i]);
        for (j = 1; j < c; j++) {
          if (q[i + 1] == x[j] && z < k - 1) {
            z++;
            x[j] = 'A';
            printf("\n");
            break;
          }
        }
      }
      printf("\n");
    } else
      printf("NO\n");
  }
  return 0;
}
