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;
const long long INF = 1e9;
const long long INFLL = 1e12;
const long long MOD = 1000000007;
const long double eps = 1e-6;
const long long MOD2 = (1 << 30) + 1;
const long long dosz = 5e5;
void fast_io() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void solve() {
  long long n;
  cin >> n;
  string s;
  cin >> s;
  vector<string> ans;
  string cur = "";
  vector<bool> used(26, false);
  used[s[0] - 'a'] = true;
  for (char i : s) {
    if (used[i - 'a'])
      cur += i;
    else {
      used[i - 'a'] = true;
      ans.push_back(cur);
      cur = i;
    }
  }
  ans.push_back(cur);
  if (ans.size() < n) {
    cout << "NO";
  } else {
    cout << "YES" << endl;
    for (long long i = 0; i < n - 1; i++) {
      cout << ans[i] << endl;
    }
    for (long long i = n - 1; i < ans.size(); i++) cout << ans[i];
  }
}
signed main() {
  long long q = 1;
  while (q--) {
    solve();
  }
  return 0;
}
