#include <bits/stdc++.h>
using namespace std;
const int MOD(1000000007);
const int INF((1 << 30) - 1);
const int MAXN();
int main() {
  int n;
  scanf("%d", &n);
  string a;
  cin >> a;
  int b[26];
  for (int i = 0; i < 26; i++) b[i] = -1;
  vector<int> d;
  int cnt = 0;
  for (int i = 0; i < a.size(); i++) {
    if (b[a[i] - 'a'] == -1) {
      cnt++;
      b[a[i] - 'a'] = i;
      if (d.size() < n) d.push_back(i);
    }
  }
  if (cnt < n) {
    printf("NO");
  } else {
    sort(d.begin(), d.end());
    printf("YES\n");
    for (int i = 0; i < d.size() - 1; i++)
      cout << a.substr(d[i], d[i + 1] - d[i]) << endl;
    cout << a.substr(d[d.size() - 1], a.size() - d[d.size() - 1]);
  }
}
