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;
string second, s1[12345];
int n, c, j;
map<char, bool> mp;
set<char> ss;
int main() {
  cin >> n >> second;
  if (second.size() < n) {
    cout << "NO";
    return 0;
  }
  for (int i = 0; i < second.size(); ++i) {
    ss.insert(second[i]);
  }
  if (n > ss.size()) {
    cout << "NO";
    return 0;
  }
  cout << "YES" << endl;
  cout << second[0];
  mp[second[0]] = true;
  for (int i = 1; i < second.size(); ++i) {
    if (second[i] == second[i - 1]) {
      cout << second[i];
    } else if (c < n) {
      if (c == n - 1) {
        cout << second[i];
      } else if (mp[second[i]] == false) {
        cout << endl;
        c++;
        cout << second[i];
        mp[second[i]] = true;
      } else {
        cout << second[i];
      }
    }
  }
}
