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;
bool h[26];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int k, t = 0;
  string s;
  cin >> k >> s;
  for (int i = 0; i < s.size(); i++) {
    if (!h[s[i] - 'a']) t++;
    h[s[i] - 'a'] = true;
  }
  if (k > t)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    fill(h, h + 26, false);
    int i = 0, t = 0;
    while (i < s.size() && t < k - 1) {
      if (h[s[i] - 'a'])
        cout << s[i];
      else {
        if (t != 0) cout << endl;
        cout << s[i];
        t++;
        h[s[i] - 'a'] = true;
      }
      i++;
    }
    while (h[s[i] - 'a']) {
      cout << s[i];
      i++;
    }
    if (k != 1) cout << endl;
    for (int j = i; j < s.size(); j++) cout << s[j];
    cout << endl;
  }
  return 0;
}
