#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, x, j;
  cin >> n;
  int dp[n], flag = 0;
  string arr[n], s;
  multimap<int, string> m;
  for (i = 0; i < n; i++) {
    cin >> arr[i];
    x = arr[i].length();
    dp[i] = x;
    m.insert({x, arr[i]});
  }
  sort(dp, dp + n);
  auto itr = m.begin();
  for (i = 0; i < n; i++) {
    x = dp[i];
    itr = m.find(x);
    arr[i] = itr->second;
    m.erase(itr);
  }
  for (i = 1; i < n; i++) {
    flag = 0;
    x = arr[i - 1].length();
    for (j = 0; j <= arr[i].length() - x; j++) {
      if (j == 0) {
        s = arr[i].substr(j, j + x);
      } else {
        s = arr[i].substr(j, x);
      }
      if (arr[i - 1] == s) {
        flag = 1;
        break;
      }
    }
    if (flag == 0) {
      break;
    }
  }
  if (flag == 0 && n != 1) {
    cout << "NO";
  } else {
    cout << "YES" << endl;
    for (i = 0; i < n; i++) {
      cout << arr[i] << endl;
    }
  }
  return 0;
}
