#include <bits/stdc++.h>
using namespace std;
void FAST_IO() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
void err(istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << ": " << a << " ";
  err(++it, args...);
}
string format(const string& s, ...) {
  va_list args;
  va_start(args, s);
  size_t len = vsnprintf(NULL, 0, s.c_str(), args);
  va_end(args);
  std::vector<char> vec(len + 1);
  va_start(args, s);
  vsnprintf(&vec[0], len + 1, s.c_str(), args);
  va_end(args);
  return &vec[0];
}
const double PI = acos(-1.0);
const int MOD = 1e9 + 7;
const int INF = 2e9;
int n;
vector<string> arr;
void read() {
  cin >> n;
  arr.resize(n + 1);
  for (int i = (int)1; i <= (int)n; ++i) {
    cin >> arr[i];
  }
}
void solve() {
  int cnt = 0;
  vector<pair<int, int> > sorted;
  for (int i = (int)1; i <= (int)n; ++i) {
    int cur = 0;
    for (int j = (int)1; j <= (int)n; ++j) {
      if (i == j) continue;
      if (arr[i].size() >= arr[j].size() &&
          arr[i].find(arr[j]) != string::npos) {
        ++cur;
      }
    }
    sorted.push_back({cur, i});
    cnt += cur;
  }
  sort(sorted.begin(), sorted.end());
  bool flag = true;
  for (int i = n - 1; i >= 0; --i) {
    if (sorted[i].first < i) {
      flag = false;
    }
  }
  if (!flag) {
    cout << "NO" << '\n';
    ;
    return;
  }
  cout << "YES\n";
  for (auto i : sorted) {
    cout << arr[i.second] << '\n';
    ;
  }
}
int main() {
  FAST_IO();
  int TC = 1;
  for (int tc = (int)1; tc <= (int)TC; ++tc) {
    read();
    solve();
  }
  return 0;
}

### Prompt

In CPP, your task is to solve the following problem:

You are given n strings. Each string consists of lowercase English letters. Rearrange (reorder) the given strings in such a way that for every string, all strings that are placed before it are its substrings.

String a is a substring of string b if it is possible to choose several consecutive letters in b in such a way that they form a. For example, string "for" is contained as a substring in strings "codeforces", "for" and "therefore", but is not contained as a substring in strings "four", "fofo" and "rof".

Input

The first line contains an integer n (1 ≤ n ≤ 100) — the number of strings.

The next n lines contain the given strings. The number of letters in each string is from 1 to 100, inclusive. Each string consists of lowercase English letters.

Some strings might be equal.

Output

If it is impossible to reorder n given strings in required order, print "NO" (without quotes).

Otherwise print "YES" (without quotes) and n given strings in required order.

Examples

Input

5
a
aba
abacaba
ba
aba


Output

YES
a
ba
aba
aba
abacaba


Input

5
a
abacaba
ba
aba
abab


Output

NO


Input

3
qwerty
qwerty
qwerty


Output

YES
qwerty
qwerty
qwerty

Note

In the second example you cannot reorder the strings because the string "abab" is not a substring of the string "abacaba".

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
void FAST_IO() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
void err(istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << ": " << a << " ";
  err(++it, args...);
}
string format(const string& s, ...) {
  va_list args;
  va_start(args, s);
  size_t len = vsnprintf(NULL, 0, s.c_str(), args);
  va_end(args);
  std::vector<char> vec(len + 1);
  va_start(args, s);
  vsnprintf(&vec[0], len + 1, s.c_str(), args);
  va_end(args);
  return &vec[0];
}
const double PI = acos(-1.0);
const int MOD = 1e9 + 7;
const int INF = 2e9;
int n;
vector<string> arr;
void read() {
  cin >> n;
  arr.resize(n + 1);
  for (int i = (int)1; i <= (int)n; ++i) {
    cin >> arr[i];
  }
}
void solve() {
  int cnt = 0;
  vector<pair<int, int> > sorted;
  for (int i = (int)1; i <= (int)n; ++i) {
    int cur = 0;
    for (int j = (int)1; j <= (int)n; ++j) {
      if (i == j) continue;
      if (arr[i].size() >= arr[j].size() &&
          arr[i].find(arr[j]) != string::npos) {
        ++cur;
      }
    }
    sorted.push_back({cur, i});
    cnt += cur;
  }
  sort(sorted.begin(), sorted.end());
  bool flag = true;
  for (int i = n - 1; i >= 0; --i) {
    if (sorted[i].first < i) {
      flag = false;
    }
  }
  if (!flag) {
    cout << "NO" << '\n';
    ;
    return;
  }
  cout << "YES\n";
  for (auto i : sorted) {
    cout << arr[i.second] << '\n';
    ;
  }
}
int main() {
  FAST_IO();
  int TC = 1;
  for (int tc = (int)1; tc <= (int)TC; ++tc) {
    read();
    solve();
  }
  return 0;
}

```