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;
map<char, int> mp;
int main() {
  int k, i;
  string s;
  cin >> k >> s;
  if (k == 1)
    cout << "YES" << endl << s;
  else if (k > s.size())
    cout << "NO";
  else {
    int st = s[0], p = 0;
    string a = "";
    a += s[0];
    mp[st]++;
    string b[s.size() + 1];
    int j = 0;
    for (i = 1; i < s.size() && p < k - 1; i++) {
      if (s[i] != st && mp[s[i]] == 0) {
        b[j++] = a;
        st = s[i];
        mp[st]++;
        a.erase();
        p++;
        a += s[i];
      } else {
        a += s[i];
      }
    }
    if (p < k - 1)
      cout << "NO";
    else {
      while (i < s.size()) a += s[i++];
      b[j++] = a;
      cout << "YES" << endl;
      for (i = 0; i < j; i++) cout << b[i] << endl;
    }
  }
  return 0;
}
