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() {
  int n, i, j = 1;
  string s1[28], s;
  cin >> n;
  cin >> s;
  int mark[26];
  memset(mark, 0, sizeof(26));
  string::iterator it = s.begin(), it1 = s.begin();
  mark[*it - 'a'] = 1;
  it++;
  if (n == 1) {
    cout << "YES" << endl;
    cout << s;
    return 0;
  }
  while (it <= s.end()) {
    if (j == n) {
      s1[j].assign(it1, s.end());
      cout << "YES" << endl;
      for (i = 1; i <= n; i++) {
        cout << s1[i] << endl;
      }
      return 0;
    }
    if (mark[*it - 'a'] == 1) {
      it++;
    } else {
      s1[j].assign(it1, it);
      it1 = it;
      j++;
      mark[*it - 'a'] = 1;
      it++;
    }
  }
  cout << "NO";
  return 0;
}
