#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream& operator<<(ostream& os, vector<T> object) {
  for (auto& i : object) {
    os << i;
  }
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, vector<vector<T>> object) {
  for (auto& i : object) {
    os << i << endl;
  }
  return os;
}
const size_t MAX_N = (long long)2e5 + 10;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<string> a(n);
  for (auto& i : a) {
    cin >> i;
  }
  sort(a.begin(), a.end(),
       [](string l, string r) { return l.length() < r.length(); });
  for (size_t i = 0; i < n - 1; i++) {
    if (a[i + 1].find(a[i]) == string::npos) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  for (auto& i : a) {
    cout << i << endl;
  }
  return 0;
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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;
template <typename T>
ostream& operator<<(ostream& os, vector<T> object) {
  for (auto& i : object) {
    os << i;
  }
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, vector<vector<T>> object) {
  for (auto& i : object) {
    os << i << endl;
  }
  return os;
}
const size_t MAX_N = (long long)2e5 + 10;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<string> a(n);
  for (auto& i : a) {
    cin >> i;
  }
  sort(a.begin(), a.end(),
       [](string l, string r) { return l.length() < r.length(); });
  for (size_t i = 0; i < n - 1; i++) {
    if (a[i + 1].find(a[i]) == string::npos) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  for (auto& i : a) {
    cout << i << endl;
  }
  return 0;
}

```