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;
long long i, j, k, l, n, m, x, y, a[1000000], b[30];
string s;
int main() {
  ios_base::sync_with_stdio(NULL);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> s;
  for (i = 0; i < s.size(); i++) a[s[i] - 96]++;
  for (i = 1; i <= 26; i++)
    if (a[i] > 0) l++;
  if (l < n) {
    cout << "NO";
    exit(0);
  }
  cout << "YES" << endl;
  l = 1;
  b[s[0] - 96] = 1;
  for (i = 0; i < s.size(); i++) {
    cout << s[i];
    if (s[i] != s[i + 1] && b[s[i + 1] - 96] == 0)
      if (l < n && n != 1) {
        b[s[i + 1] - 96] = 1;
        l++;
        cout << endl;
      }
  }
}
