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 k;
  string q;
  cin >> k >> q;
  int tab[26];
  for (int i = 0; i < 26; i++) tab[i] = 0;
  for (int i = 0; i < q.length(); i++) {
    int g = q[i] - 97;
    tab[g]++;
  }
  int j = 0;
  for (int i = 0; i < 26; i++)
    if (tab[i] > 0) j++;
  if (j < k) {
    cout << "NO" << endl;
    return 0;
  } else
    cout << "YES" << endl;
  int u = 0, v = 0, y = v;
  bool t[26];
  for (int i = 0; i < 26; i++) {
    t[i] = true;
  }
  while (u < k - 1) {
    y = v;
    t[q[y] - 97] = false;
    while (!t[q[v] - 97]) {
      v++;
    }
    for (int i = y; i < v; i++) cout << q[i];
    cout << endl;
    u++;
  }
  for (int i = v; i < q.length(); i++) {
    cout << q[i];
  }
  cout << endl;
  return 0;
}
