#include <bits/stdc++.h>
using namespace std;
const int prime = 999983;
const int INF = 0x7FFFFFFF;
const long long INFF = 0x7FFFFFFFFFFFFFFF;
const double pi = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-6;
const long long mod = 1e9 + 7;
int dr[2][4] = {1, -1, 0, 0, 0, 0, -1, 1};
string ss[1000];
bool cmp(const string &a, const string &b) { return a.size() < b.size(); }
int main(void) {
  int maxnlen = 0;
  string s;
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> ss[i];
  }
  bool yes = 1;
  sort(ss, ss + n, cmp);
  for (int i = 1; i < n; ++i) {
    if (ss[i].find(ss[i - 1]) == string::npos) {
      yes = false;
      break;
    }
  }
  if (yes) {
    cout << "YES" << endl;
    for (int i = 0; i < n; ++i) cout << ss[i] << endl;
  } else
    cout << "NO" << 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;
const int prime = 999983;
const int INF = 0x7FFFFFFF;
const long long INFF = 0x7FFFFFFFFFFFFFFF;
const double pi = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-6;
const long long mod = 1e9 + 7;
int dr[2][4] = {1, -1, 0, 0, 0, 0, -1, 1};
string ss[1000];
bool cmp(const string &a, const string &b) { return a.size() < b.size(); }
int main(void) {
  int maxnlen = 0;
  string s;
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> ss[i];
  }
  bool yes = 1;
  sort(ss, ss + n, cmp);
  for (int i = 1; i < n; ++i) {
    if (ss[i].find(ss[i - 1]) == string::npos) {
      yes = false;
      break;
    }
  }
  if (yes) {
    cout << "YES" << endl;
    for (int i = 0; i < n; ++i) cout << ss[i] << endl;
  } else
    cout << "NO" << endl;
  return 0;
}

```