#include <bits/stdc++.h>
using namespace std;
int a[10000007];
long long int c1 = 0;
vector<int> v2;
long long int p;
int flag = 0;
bool cmp(string s, string p) {
  if (s.length() == p.length()) return s < p;
  return s.length() < p.length();
}
int main() {
  long long int k, x, y;
  x = -1;
  int n;
  int c = 0;
  int c1 = 0;
  cin >> n;
  string s[n];
  for (int i = 1; i <= n; i++) {
    cin >> s[i - 1];
  }
  sort(s, s + n, cmp);
  int flag = 1;
  for (int i = 1; i < n; i++) {
    if (s[i].length() == s[i - 1].length()) {
      if (s[i] != s[i - 1]) flag = 0;
    }
  }
  if (flag) {
    string d = s[n - 1];
    for (int i = 1; i < n; i++) {
      int flag = 0;
      for (int j = 1; j <= s[i].length(); j++) {
        string c1 = "\0";
        c1 += s[i][j - 1];
        if (c1 == s[i - 1]) {
          flag = 1;
          break;
        }
        for (int k = j + 1; k <= s[i].length(); k++) {
          c1 += s[i][k - 1];
          if (c1 == s[i - 1]) flag = 1;
        }
      }
      if (flag == 0) return cout << "NO", 0;
    }
    cout << "YES\n";
    for (int i = 1; i <= n; i++) cout << s[i - 1] << endl;
  } else
    cout << "NO\n";
}
