#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
bool cmp(string& a, string& b) { return a.size() < b.size(); }
bool check(string a, string b) {
  if (a.size() == b.size()) return (a == b);
  for (int i = 0; i <= b.size() - a.size(); ++i) {
    bool can = true;
    for (int j = 0; j < a.size(); ++j) {
      if (b[i + j] != a[j]) {
        can = false;
        break;
      }
    }
    if (can) return true;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  int n;
  cin >> n;
  vector<string> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  sort(a.begin(), a.end(), cmp);
  bool can = true;
  for (int i = 1; i < n; ++i) {
    if (check(a[i - 1], a[i]) == false) can = false;
  }
  if (!can)
    cout << "NO";
  else {
    cout << "YES" << '\n';
    for (string x : a) cout << x << '\n';
  }
  return 0;
}

### Prompt

In Cpp, your task is to solve 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;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
bool cmp(string& a, string& b) { return a.size() < b.size(); }
bool check(string a, string b) {
  if (a.size() == b.size()) return (a == b);
  for (int i = 0; i <= b.size() - a.size(); ++i) {
    bool can = true;
    for (int j = 0; j < a.size(); ++j) {
      if (b[i + j] != a[j]) {
        can = false;
        break;
      }
    }
    if (can) return true;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  int n;
  cin >> n;
  vector<string> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  sort(a.begin(), a.end(), cmp);
  bool can = true;
  for (int i = 1; i < n; ++i) {
    if (check(a[i - 1], a[i]) == false) can = false;
  }
  if (!can)
    cout << "NO";
  else {
    cout << "YES" << '\n';
    for (string x : a) cout << x << '\n';
  }
  return 0;
}

```