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 k, l;
string s;
vector<char> ans[200];
bool c[1000];
int main() {
  ios_base::sync_with_stdio(0);
  cin >> k >> s;
  for (int i = 0; i < s.size(); i++) {
    if (!c[s[i]] && l != k) {
      l++;
      c[s[i]] = true;
    }
    ans[l].push_back(s[i]);
  }
  if (l != k) {
    cout << "NO";
    return 0;
  }
  cout << "YES" << endl;
  for (int i = 1; i <= l; i++) {
    for (int j = 0; j < ans[i].size(); j++) cout << ans[i][j];
    cout << endl;
  }
  return 0;
}
