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;
  cin >> n;
  string s;
  cin >> s;
  set<char> ss;
  for (char c : s) ss.insert(c);
  if (ss.size() < n)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    int vis[30];
    memset(vis, 0, sizeof vis);
    string res = "";
    for (char c : s) {
      if (n == 1)
        res += c;
      else {
        if (res.size() > 0 and !vis[c - 'a']) {
          n--;
          vis[c - 'a'] = 1;
          cout << res << endl;
          res = string(1, c);
        } else {
          vis[c - 'a'] = 1;
          res += c;
        }
      }
    }
    cout << res << endl;
  }
  return 0;
}
