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;
  string s;
  cin >> n;
  cin >> s;
  int i;
  int r = s.size();
  map<char, int> A;
  int coun = 0;
  vector<int> V;
  for (i = 0; i < r; i++) {
    if (A.find(s[i]) == A.end()) {
      A[s[i]] = i;
      coun++;
      V.push_back(i);
    }
  }
  if (coun < n)
    printf("NO\n");
  else {
    printf("YES\n");
    int f = V.size();
    for (i = 0; i < f; i++) {
      if (n > 1) {
        for (int j = V[i]; j < V[i + 1]; ++j) cout << s[j];
        cout << endl;
        n--;
      } else {
        for (int j = V[i]; j < r; ++j) cout << s[j];
        return 0;
      }
    }
  }
  return 0;
}
