#include <bits/stdc++.h>
using namespace std;
class TaskB {
 public:
  void solve(std::istream &in, std::ostream &out) {
    int n;
    in >> n;
    string s;
    pair<int, string> p[n];
    for (int i = 0; i < n; ++i) {
      in >> s;
      p[i] = make_pair(s.length(), s);
    }
    sort(p, p + n);
    bool flag = true;
    for (int i = 0; i < n - 1; ++i) {
      if (p[i + 1].second.find(p[i].second) == string::npos) {
        flag = false;
        break;
      }
    }
    if (flag) {
      out << "YES" << endl;
      for (int i = 0; i < n; ++i) out << p[i].second << endl;
    } else
      out << "NO" << endl;
  }
};
int main() {
  TaskB solver;
  std::istream &in(std::cin);
  std::ostream &out(std::cout);
  solver.solve(in, out);
  return 0;
}

### Prompt

Create a solution in Cpp for 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;
class TaskB {
 public:
  void solve(std::istream &in, std::ostream &out) {
    int n;
    in >> n;
    string s;
    pair<int, string> p[n];
    for (int i = 0; i < n; ++i) {
      in >> s;
      p[i] = make_pair(s.length(), s);
    }
    sort(p, p + n);
    bool flag = true;
    for (int i = 0; i < n - 1; ++i) {
      if (p[i + 1].second.find(p[i].second) == string::npos) {
        flag = false;
        break;
      }
    }
    if (flag) {
      out << "YES" << endl;
      for (int i = 0; i < n; ++i) out << p[i].second << endl;
    } else
      out << "NO" << endl;
  }
};
int main() {
  TaskB solver;
  std::istream &in(std::cin);
  std::ostream &out(std::cout);
  solver.solve(in, out);
  return 0;
}

```