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;
bool cmp(vector<int> a, vector<int> b) { return a.size() < b.size(); }
int main() {
  int n;
  string s, ans[100];
  map<char, int> m, st;
  cin >> n >> s;
  for (int i = 0; i < s.size(); i++) {
    m[s[i]]++;
  }
  if (m.size() < n) {
    cout << "NO";
    return 0;
  }
  cout << "YES\n";
  if (n == 1) {
    cout << s;
    return 0;
  }
  int j = 0;
  int u[101] = {0};
  int si = 0;
  while (j <= n - 1) {
    st[s[si]] = 1;
    for (int i = si; i < s.size(); i++) {
      si = i;
      if (st[s[i]] == 1) {
        ans[j] += s[i];
        u[i] = 1;
      } else
        break;
    }
    j++;
  }
  for (int i = si; i < s.size(); i++) {
    if (u[i] == 0) ans[n - 1] += s[i];
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}
