#include <bits/stdc++.h>
using namespace std;
struct c {
  string s;
  bool operator<(c k1) const { return s.size() < k1.s.size(); }
};
vector<c> v;
c kk;
vector<string> vv;
int main() {
  long long n, q, i, j = 0, temp, ans = 0, sum = 0, x, y, z;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> kk.s;
    v.push_back(kk);
  }
  sort(v.begin(), v.end());
  vv.push_back(v[0].s);
  for (int i = 1; i < v.size(); i++) {
    if (v[i].s.find(vv[vv.size() - 1]) != string ::npos) {
    } else {
      cout << "NO\n";
      return 0;
    }
    vv.push_back(v[i].s);
  }
  cout << "YES\n";
  for (int i = 0; i < vv.size(); i++) {
    cout << vv[i] << endl;
  }
}

### Prompt

Generate 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;
struct c {
  string s;
  bool operator<(c k1) const { return s.size() < k1.s.size(); }
};
vector<c> v;
c kk;
vector<string> vv;
int main() {
  long long n, q, i, j = 0, temp, ans = 0, sum = 0, x, y, z;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> kk.s;
    v.push_back(kk);
  }
  sort(v.begin(), v.end());
  vv.push_back(v[0].s);
  for (int i = 1; i < v.size(); i++) {
    if (v[i].s.find(vv[vv.size() - 1]) != string ::npos) {
    } else {
      cout << "NO\n";
      return 0;
    }
    vv.push_back(v[i].s);
  }
  cout << "YES\n";
  for (int i = 0; i < vv.size(); i++) {
    cout << vv[i] << endl;
  }
}

```