#include <bits/stdc++.h>
using namespace std;
int fx[] = {1, -1, 0, 0};
int fy[] = {0, 0, 1, -1};
vector<pair<int, string> > pq;
int main() {
  int N;
  cin >> N;
  for (int i = 1; i <= N; i++) {
    string str;
    cin >> str;
    pq.push_back(pair<int, string>(str.size(), str));
  }
  vector<string> v;
  vector<string> v2;
  sort(pq.begin(), pq.end());
  for (int i = 0; i < pq.size(); i++) {
    string str = pq[i].second;
    int f1 = 0, f2 = 0, f3 = 0, f4 = 0;
    for (int j = i + 1; j <= pq.size() - 1; j++) {
      string str2;
      str2 = pq[j].second;
      f4 = 0;
      for (int k = 0; k < str2.size(); k++) {
        if (f4) break;
        if (str2[k] == str[0]) {
          for (int x = 1; x <= str.size() - 1; x++) {
            if (str2[k + x] != str[x]) break;
            if (x == str.size() - 1) f4 = 1;
          }
          if (str.size() == 1) f4 = 1;
        }
      }
      if (!f4) break;
      if (j == pq.size() - 1) {
        v2.push_back(str);
      }
    }
  }
  if (v2.size() < N - 1) {
    cout << "NO\n";
    return 0;
  }
  cout << "YES\n";
  for (int i = 0; i < v2.size(); i++) cout << v2[i] << "\n";
  cout << pq[pq.size() - 1].second << "\n";
}
