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() {
  char str[101];
  int n, i, cn[26] = {0}, br[101] = {0}, cnt = 0, prin = 0;
  scanf("%d", &n);
  scanf("%s", &str);
  for (i = 0; str[i] != '\0'; i++) {
    if (!cn[str[i] - 'a']) {
      cn[str[i] - 'a']++;
      br[i] = 1;
      cnt++;
    }
  }
  if (n > cnt) {
    printf("NO\n");
  } else {
    printf("YES\n");
    putchar(str[0]);
    prin++;
    for (i = 1; str[i] != '\0'; i++) {
      if (prin < n) {
        if (br[i]) {
          putchar('\n');
          putchar(str[i]);
          prin++;
        } else
          putchar(str[i]);
      } else
        putchar(str[i]);
    }
    putchar('\n');
  }
  return 0;
}
