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 main() {
  int k, i, c = 0, j, q;
  scanf("%d", &k);
  char ct = getchar();
  char str[101];
  scanf("%s", str);
  int temp[150] = {0}, arr[101], p = 0;
  for (i = 0; i < strlen(str); i++) {
    if (temp[str[i]] == 0) {
      arr[p++] = i;
      temp[str[i]]++;
      c++;
    }
  }
  if (c >= k) {
    printf("YES\n");
    q = 0;
    i = 1;
    for (j = arr[q]; i < k; j++) {
      if (j != arr[q + 1])
        printf("%c", str[j]);
      else
        j--, i++, q++, printf("\n");
    }
    for (i = arr[q]; i < strlen(str); i++) printf("%c", str[i]);
  } else
    printf("NO");
  return 0;
}
