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 a, b, c, d;
  char ZA[101], ZB[26], ZC[126];
  scanf("%d%s", &a, ZA);
  for (b = 0; b < 26; ZB[b++] = 0)
    ;
  ZB[ZA[0] - 'a'] = 1;
  ZC[0] = ZA[0];
  c = 1;
  d = 1;
  for (b = 1; ZA[b] && c < a; ++b)
    if (ZB[ZA[b] - 'a'] == 0) {
      c += 1;
      ZC[d++] = '\n';
      ZC[d++] = ZA[b];
      ZB[ZA[b] - 'a'] = 1;
    } else {
      ZC[d++] = ZA[b];
    }
  ZC[d] = 0;
  if (c < a)
    printf("NO\n");
  else
    printf("YES\n%s%s\n", ZC, ZA + b);
  return 0;
}
