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;
vector<string> str;
vector<int> t;
int main() {
  int i, k, j, r;
  string s, s2;
  while (cin >> k) {
    cin >> s;
    s2 = "";
    int ele = 1;
    str.clear();
    t.clear();
    t.push_back(0);
    for (i = 0; i < s.size(); i++) {
      r = 1;
      for (j = 0; j < t.size(); j++) {
        if (s[i] == s[t[j]]) {
          r = 0;
        }
      }
      if (r == 0 || ele == k) {
        s2 += s[i];
      } else if (r == 1) {
        str.push_back(s2);
        t.push_back(i);
        s2 = s[i];
        ele++;
      }
    }
    if (s2.size()) str.push_back(s2);
    if (str.size() < k) {
      cout << "NO\n";
    } else {
      cout << "YES\n";
      for (i = 0; i < str.size(); i++) cout << str[i] << endl;
    }
  }
  return 0;
}
