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() {
  int n, a[150], k = 0, b[150], f = 0;
  char c;
  string s;
  memset(a, 0, sizeof(a));
  memset(b, 0, sizeof(b));
  cin >> n >> s;
  for (int i = 0; i < s.length(); i++) a[s[i]] = 1;
  for (int i = 0; i < 150; i++) k += a[i];
  c = s[0];
  if (k < n)
    cout << "NO";
  else {
    cout << "YES" << endl;
    for (int i = 0; i < s.length(); i++) {
      if (i == 0) {
        cout << s[i];
        b[s[i]] = 1;
      } else {
        if (c != s[i] && n - f > 1 && b[s[i]] == 0) {
          cout << endl << s[i];
          c = s[i];
          f++;
          b[s[i]] = 1;
        } else
          cout << s[i];
      }
    }
  }
}
