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 k, size, r;
string temp;
bool flag[28];
bool check[28];
int main() {
  cin >> k >> temp;
  size = temp.size();
  for (int i = 0; i < size; i++) {
    if (flag[temp[i] - 'a'])
      continue;
    else {
      flag[temp[i] - 'a'] = true;
      r++;
    }
  }
  if (k > r)
    cout << "NO" << endl;
  else {
    cout << "YES";
    int cur = 0;
    for (int i = 0; i < k; i++) {
      cout << endl;
      if (!check[temp[cur] - 'a']) {
        check[temp[cur] - 'a'] = true;
        while ((check[temp[cur] - 'a']) && cur < size) cout << temp[cur++];
      }
    }
    while (cur < size) cout << temp[cur++];
    cout << endl;
  }
  return 0;
}
