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, i, cnt = 0;
  char p;
  cin >> k;
  string q;
  cin >> q;
  map<char, int> m;
  for (i = 0; i < q.length(); i++) m[q[i]]++;
  for (p = 'a'; p <= 'z'; p++)
    if (m[p] > 0) cnt++;
  if (k > cnt) {
    cout << "NO";
    return 0;
  }
  cout << "YES" << endl;
  i = 0;
  while (k > 1) {
    cout << q[i];
    m[q[i]] = 0;
    i++;
    while (m[q[i]] == 0) {
      cout << q[i];
      m[q[i]] = 0;
      i++;
    }
    k--;
    cout << endl;
  }
  while (i < q.length()) {
    cout << q[i];
    i++;
  }
  return 0;
}
