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 memo[26], Count;
vector<int> ind;
int main() {
  int n;
  string x;
  cin >> n >> x;
  for (int i = 0; i < x.size(); i++)
    if (!memo[x[i] - 'a']++ && Count < n) Count++, ind.push_back(i);
  if (Count < n)
    cout << "NO" << endl, x.clear();
  else
    cout << "YES" << endl, ind.push_back(int(x.size()));
  for (int i = 0, j = 1; i < x.size(); i++)
    if (i == ind[j])
      cout << endl << x[i], j++;
    else
      cout << x[i];
}
