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 debug = 0;
int k;
string s;
vector<string> ans;
bool mark[26];
vector<int> pos;
void solve() {
  cin >> k >> s;
  for (int i = 0; i < s.length(); i++)
    if (!mark[s[i] - 'a']) {
      mark[s[i] - 'a'] = true;
      pos.push_back(i);
    }
  pos.push_back(s.length());
  if (pos.size() - 1 < k) {
    cout << "NO";
    return;
  }
  cout << "YES" << endl;
  for (int i = 0; i < pos.size() - 1; i++) {
    string t = "";
    for (int j = pos[i]; j < pos[i + 1]; j++) t += s[j];
    ans.push_back(t);
  }
  int i = 0;
  for (i = 0; i < k - 1; i++) cout << ans[i] << endl;
  for (int i = k - 1; i < ans.size(); i++) cout << ans[i];
}
int main() {
  solve();
  return 0;
}
