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 check[100];
int main() {
  int n;
  string s;
  cin >> n;
  cin >> s;
  int ans = 0;
  for (int x = 0; x < s.size(); ++x) {
    if (!check[s[x] - 'a']) {
      ans++;
      check[s[x] - 'a'] = 1;
    }
  }
  cout << ((ans >= n) ? "YES" : "NO") << endl;
  if (ans >= n) {
    for (int x = 0; x < s.size(); ++x) {
      if (n) {
        if (check[s[x] - 'a']) {
          if (x) cout << endl;
          cout << s[x];
          check[s[x] - 'a'] = 0;
          n--;
        } else {
          cout << s[x];
        }
      } else
        cout << s[x];
    }
    cout << endl;
  }
}
