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 main() {
  ios_base::sync_with_stdio(false);
  ;
  cin.tie(NULL);
  ;
  int k;
  string s;
  cin >> k >> s;
  if (k == 1) {
    cout << "YES\n" << s << endl;
  } else {
    string v[k];
    int i = 0, j = 0, n = s.size();
    set<char> ch;
    while (true) {
      if (i == k - 1) {
        v[i].append(s.substr(j, n - j));
        i++;
        break;
      } else {
        ch.insert(s[j]);
        while (ch.count(s[j])) {
          v[i].push_back(s[j]);
          j++;
          if (j == n) {
            break;
          }
        }
        if (j == n) {
          break;
        }
        i++;
        if (i == k) {
          break;
        }
      }
    }
    if (i == k) {
      cout << "YES\n";
      for (i = 0; i < k; i++) {
        cout << v[i] << endl;
      }
    } else {
      cout << "NO\n";
    }
  }
}
