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;
  char arr[100];
  cin >> n;
  cin >> arr;
  int m = strlen(arr);
  int i;
  int visited[26] = {0}, cnt = 0;
  for (i = 0; i < m; i++) {
    if ((visited[arr[i] - 97]) == 0) {
      cnt++;
      visited[arr[i] - 97] = 1;
    }
  }
  if (n > cnt) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  memset(visited, 0, sizeof(visited));
  cnt = 0;
  for (i = 0; i < m - 1; i++) {
    int f = 0;
    cout << arr[i];
    visited[arr[i] - 97] = 1;
    while (visited[arr[i + 1] - 97] == 1) {
      cout << arr[i + 1];
      i++;
      f = 1;
    }
    cnt++;
    if (cnt == n) {
      i++;
      while (i < m) {
        cout << arr[i];
        i++;
      }
    }
    cout << endl;
  }
  if (i == m - 1) {
    cout << arr[i] << endl;
  }
  return 0;
}
