#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e5 + 4;
bool cmp(const pair<string, int> &a, const pair<string, int> &b) {
  if (a.second < b.second)
    return true;
  else
    return false;
}
int isSubstring(string s1, string s2) {
  int M = s1.length();
  int N = s2.length();
  for (int i = 0; i <= N - M; i++) {
    int j;
    for (j = 0; j < M; j++)
      if (s2[i + j] != s1[j]) break;
    if (j == M) return i;
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, string> > v;
  for (int i = 0; i < n; i++) {
    string st;
    cin >> st;
    v.push_back({st.size(), st});
  }
  sort(v.begin(), v.end());
  int x = 0;
  for (int i = 0; i < n - 1; i++) {
    int res = isSubstring(v[i].second, v[i + 1].second);
    if (res != -1) {
      x = 1;
    } else {
      x = 0;
      break;
    }
  }
  if (x == 0 && n != 1)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (int i = 0; i < n; i++) {
      cout << v[i].second << "\n";
    }
  }
}
