#include <bits/stdc++.h>
using namespace std;
bool check(string s, string k) {
  for (int i = 0; i <= (int)s.size() - (int)k.size(); i++) {
    string chk = s.substr(i, k.size());
    if (chk == k) return true;
  }
  return false;
}
int main(int argc, char const *argv[]) {
  long long int n;
  string s;
  cin >> n;
  vector<string> v;
  map<int, int> mp;
  for (long long int i = 1; i <= n; i++) {
    cin >> s;
    v.push_back(s);
  }
  vector<string> tobe;
  vector<int> willbe;
  for (string i : v) {
    willbe.push_back(i.size());
  }
  sort(willbe.begin(), willbe.end());
  for (int j : willbe) {
    int got = 0;
    for (int i = 0; i < v.size(); i++) {
      if (j == v[i].size() && got == 0 && mp[i] == 0) {
        tobe.push_back(v[i]), got = 1, mp[i]++;
      }
    }
  }
  int f = 1;
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (check(tobe[j], tobe[i]) == false) {
        f = 0;
        break;
      }
    }
  }
  if (f) {
    cout << "YES\n";
    for (auto i : tobe) cout << i << endl;
  } else {
    cout << "NO\n";
  }
  return 0;
}

### Prompt

Please provide a CPP coded solution to the problem described below:

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;
bool check(string s, string k) {
  for (int i = 0; i <= (int)s.size() - (int)k.size(); i++) {
    string chk = s.substr(i, k.size());
    if (chk == k) return true;
  }
  return false;
}
int main(int argc, char const *argv[]) {
  long long int n;
  string s;
  cin >> n;
  vector<string> v;
  map<int, int> mp;
  for (long long int i = 1; i <= n; i++) {
    cin >> s;
    v.push_back(s);
  }
  vector<string> tobe;
  vector<int> willbe;
  for (string i : v) {
    willbe.push_back(i.size());
  }
  sort(willbe.begin(), willbe.end());
  for (int j : willbe) {
    int got = 0;
    for (int i = 0; i < v.size(); i++) {
      if (j == v[i].size() && got == 0 && mp[i] == 0) {
        tobe.push_back(v[i]), got = 1, mp[i]++;
      }
    }
  }
  int f = 1;
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (check(tobe[j], tobe[i]) == false) {
        f = 0;
        break;
      }
    }
  }
  if (f) {
    cout << "YES\n";
    for (auto i : tobe) cout << i << endl;
  } else {
    cout << "NO\n";
  }
  return 0;
}

```