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 n;
  string s;
  int d[100];
  for (int i = 0; i < 100; i++) d[i] = 0;
  cin >> n;
  cin >> s;
  for (int i = 0; i < s.length(); i++) {
    int x = s[i] - 'a';
    d[x]++;
  }
  int ans = 0;
  for (int i = 0; i < 100; i++) {
    if (d[i]) ans++;
  }
  vector<char> p;
  if (ans >= n) {
    cout << "YES";
    for (int i = 0; i < s.length(); i++) {
      if (!n) {
        cout << s[i];
      } else {
        int err = 0;
        for (int j = 0; j < p.size(); j++) {
          if (s[i] == p[j]) {
            err = 1;
            break;
          }
        }
        if (!err) {
          p.push_back(s[i]);
          err = 0;
          cout << endl << s[i];
          n--;
        } else
          cout << s[i];
      }
    }
  } else
    cout << "NO";
}
