#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<string> s(n);
  std::vector<pair<int, string> > par(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i];
    par[i].first = s[i].length();
    par[i].second = s[i];
  }
  cout << endl << endl;
  std::sort(par.begin(), par.end());
  for (int i = 0; i < n; i++) {
  }
  cout << endl << endl;
  int l = par[0].first;
  for (int i = 1; i < n; i++) {
    if (par[i].first != l || (par[i].second == par[i - 1].second)) {
      l = par[i].first;
    } else {
      cout << "NO\n";
      return 0;
    }
  }
  for (int i = 1; i < n; i++) {
    if (par[i].second.find(par[i - 1].second) == std::string::npos) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < n; i++) {
    cout << par[i].second << endl;
  }
  return 0;
}

### Prompt

Your challenge is to write a Cpp solution to 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;
int main() {
  int n;
  cin >> n;
  vector<string> s(n);
  std::vector<pair<int, string> > par(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i];
    par[i].first = s[i].length();
    par[i].second = s[i];
  }
  cout << endl << endl;
  std::sort(par.begin(), par.end());
  for (int i = 0; i < n; i++) {
  }
  cout << endl << endl;
  int l = par[0].first;
  for (int i = 1; i < n; i++) {
    if (par[i].first != l || (par[i].second == par[i - 1].second)) {
      l = par[i].first;
    } else {
      cout << "NO\n";
      return 0;
    }
  }
  for (int i = 1; i < n; i++) {
    if (par[i].second.find(par[i - 1].second) == std::string::npos) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < n; i++) {
    cout << par[i].second << endl;
  }
  return 0;
}

```