#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFLL = 1e18;
const int MOD = 1000000007;
const int alphabet = 26;
const int MAXINT = 2e6 + 1;
bool subStr(string s1, string s2) {
  int n1 = s1.size(), n2 = s2.size();
  bool ans = false;
  for (int k = 0; k < n2 && !ans; k++) {
    int j = 0, i = k;
    while (i < n2 && j < n1 && s2[i] == s1[j]) i++, j++;
    ans = bool(j == n1);
  }
  return ans;
}
bool tamano(string s1, string s2) {
  if (s1.size() == s2.size())
    return s1 < s2;
  else
    return s1.size() < s2.size();
}
int main() {
  int n;
  string s;
  vector<string> strs;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) cin >> s, strs.push_back(s);
  sort(strs.begin(), strs.end(), tamano);
  vector<string> ans;
  for (int i = 0; i < n; i++) {
    string sub = strs[i];
    bool valid = true;
    for (int j = i + 1; j < n && valid; j++) valid = subStr(sub, strs[j]);
    if (valid)
      ans.push_back(sub);
    else
      break;
  }
  if (ans.size() != n)
    printf("NO\n");
  else {
    printf("YES\n");
    for (string s1 : ans) cout << s1 << endl;
  }
}
