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 length = 1000 * 1000 * 1000 * 2;
int main() {
  int k;
  cin >> k;
  string s;
  cin >> s;
  vector<string> res;
  int a[300] = {0};
  for (long long i = (0); i < (s.size()); i++) a[s[i]] = 1;
  string temp = "";
  temp += s[0];
  a[s[0]] = 0;
  for (long long i = (1); i < (s.size()); i++) {
    if (a[s[i]]) {
      res.push_back(temp);
      temp = "";
      a[s[i]] = 0;
    }
    temp += s[i];
  }
  if (temp.size() != 0) res.push_back(temp);
  if (res.size() < k) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  for (long long i = (0); i < (k - 1); i++) cout << res[i] << endl;
  temp = "";
  for (long long i = (k - 1); i < (res.size()); i++) temp += res[i];
  cout << temp << endl;
  return 0;
}
