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 pos[26];
int res[26];
char s[101];
int k, n;
int main() {
  scanf("%d", &k);
  scanf("%s", s);
  for (int i = 0; i < strlen(s); i++)
    if (!pos[s[i] - 'a']) {
      pos[s[i] - 'a'] = 1;
      res[n++] = i;
    }
  if (n < k)
    printf("NO");
  else {
    res[k] = strlen(s);
    printf("YES\n");
    int i, j;
    i = 0;
    j = 1;
    while (i < strlen(s)) {
      printf("%c", s[i]);
      i++;
      if (i == res[j]) {
        printf("\n");
        j++;
      }
    }
  }
  return 0;
}
