#include <bits/stdc++.h>
using namespace std;
string A[105];
int n, i;
bool d;
bool check(string a, string b) {
  bool check;
  for (int i = 0; i < a.size(); ++i) {
    if (a[i] == b[0]) {
      check = 0;
      for (int j = 0, t = i; j < b.size(); ++j, ++t) {
        if (t >= a.size() || a[t] != b[j]) {
          check = 1;
          break;
        }
      }
      if (!check) {
        return 1;
      }
    }
  }
  return 0;
}
int main() {
  for (cin >> n; i < n; ++i) cin >> A[i];
  sort(A, A + n, [](string a, string b) {
    if (a.size() == b.size()) return a < b;
    return a.size() < b.size();
  });
  for (i = 1; i < n; ++i) {
    if (!check(A[i], A[i - 1])) {
      d = 1;
      break;
    }
  }
  if (!d) {
    cout << "YES\n";
    for (i = 0; i < n; ++i) cout << A[i] << endl;
  } else
    cout << "NO\n";
  return 0;
}

### Prompt

Your challenge is to write 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;
string A[105];
int n, i;
bool d;
bool check(string a, string b) {
  bool check;
  for (int i = 0; i < a.size(); ++i) {
    if (a[i] == b[0]) {
      check = 0;
      for (int j = 0, t = i; j < b.size(); ++j, ++t) {
        if (t >= a.size() || a[t] != b[j]) {
          check = 1;
          break;
        }
      }
      if (!check) {
        return 1;
      }
    }
  }
  return 0;
}
int main() {
  for (cin >> n; i < n; ++i) cin >> A[i];
  sort(A, A + n, [](string a, string b) {
    if (a.size() == b.size()) return a < b;
    return a.size() < b.size();
  });
  for (i = 1; i < n; ++i) {
    if (!check(A[i], A[i - 1])) {
      d = 1;
      break;
    }
  }
  if (!d) {
    cout << "YES\n";
    for (i = 0; i < n; ++i) cout << A[i] << endl;
  } else
    cout << "NO\n";
  return 0;
}

```