#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<string> a(n);
  for (auto &x : a) cin >> x;
  sort((a).begin(), (a).end(), [](const string &x, const string &y) {
    return int((x).size()) < int((y).size());
  });
  for (int i = int(0); i < int(n - 1); i++) {
    int sa = int((a[i]).size()), sb = int((a[i + 1]).size());
    bool found = false;
    for (int j = int(0); j < int(sb - sa + 1); j++) {
      if (a[i] == a[i + 1].substr(j, sa)) {
        found = true;
        break;
      }
    }
    if (!found) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (auto &x : a) cout << x << '\n';
  return 0;
}

### Prompt

Your task is to create 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;
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<string> a(n);
  for (auto &x : a) cin >> x;
  sort((a).begin(), (a).end(), [](const string &x, const string &y) {
    return int((x).size()) < int((y).size());
  });
  for (int i = int(0); i < int(n - 1); i++) {
    int sa = int((a[i]).size()), sb = int((a[i + 1]).size());
    bool found = false;
    for (int j = int(0); j < int(sb - sa + 1); j++) {
      if (a[i] == a[i + 1].substr(j, sa)) {
        found = true;
        break;
      }
    }
    if (!found) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (auto &x : a) cout << x << '\n';
  return 0;
}

```