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;
long long dr[] = {-1, 1, 0, 0, -1, 1, -1, 1};
long long dc[] = {0, 0, -1, 1, -1, -1, 1, 1};
int main() {
  long long n;
  cin >> n;
  string s;
  cin >> s;
  map<char, long long> mp;
  string tmp = "";
  vector<long long> res;
  long long cnt = 0;
  for (long long i = 0; i < s.size(); i++) {
    if (mp[s[i]] == 0) {
      res.push_back(i);
    }
    mp[s[i]]++;
  }
  if (res.size() < n) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
    res.resize(n);
    res.push_back(s.size());
    for (long long i = 0; i < n; i++) {
      for (long long j = res[i]; j < res[i + 1]; j++) {
        cout << s[j];
      }
      cout << "\n";
    }
  }
  return 0;
}
