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;
const long long int mod = 1e9 + 7;
const int maxn = 505 * 1001;
const int Base = 199;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string q;
  int n;
  cin >> n;
  cin >> q;
  set<char> ch;
  for (int i = 0; i < q.size(); i++) ch.insert(q[i]);
  if (ch.size() < n)
    return cout << "NO", 0;
  else {
    set<char> used;
    int t = 0, pos = 0;
    cout << "YES";
    while (pos < q.size()) {
      if (t < n && used.find(q[pos]) == used.end()) {
        used.insert(q[pos]);
        cout << endl << q[pos];
        t++;
        pos++;
        continue;
      }
      cout << q[pos];
      pos++;
    }
  }
  return 0;
}
