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 a[37];
int b[37];
int main() {
  int k;
  cin >> k;
  string s;
  cin >> s;
  int len = s.length();
  vector<int> vc;
  for (int i = 0; i < len; i++) {
    if (a[s[i] - 'a'] == 0) vc.push_back(i);
    a[s[i] - 'a'] = i + 1;
  }
  int cnt = 0;
  for (int i = 0; i < 26; i++)
    if (a[i]) cnt++;
  sort(vc.begin(), vc.end());
  if (cnt >= k) {
    cout << "YES\n";
    int c = 0;
    for (int i = 1; i <= k; i++) {
      int l = len - 1;
      if (i != k) l = vc[i] - 1;
      for (int j = c; j <= l; j++) cout << s[j];
      c = l + 1;
      cout << endl;
    }
  } else {
    cout << "NO";
  }
  return 0;
}
