#include <bits/stdc++.h>
using namespace std;
bool substr(string s1, string s2) {
  bool temp = 0;
  for (int i = 0; i < s2.size() - s1.size() + 1; i++) {
    int x = 0;
    for (int j = 0; j <= s1.size(); j++) {
      if (s1[j] == s2[j + i]) {
        x++;
      } else {
        if (x == s1.size()) return 1;
        break;
      }
      if (x == s1.size()) return 1;
    }
  }
  return 0;
}
int main() {
  int i, j, k, n, count = 0;
  cin >> n;
  vector<pair<int, string> > v;
  string s;
  for (i = 0; i < n; i++) {
    cin >> s;
    v.push_back(make_pair(s.size(), s));
  }
  sort(v.begin(), v.end());
  for (i = 0; i < n - 1; i++) {
    if (!substr(v[i].second, v[i + 1].second)) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES\n";
  for (i = 0; i < n; i++) cout << v[i].second << "\n";
}

### Prompt

Please formulate 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;
bool substr(string s1, string s2) {
  bool temp = 0;
  for (int i = 0; i < s2.size() - s1.size() + 1; i++) {
    int x = 0;
    for (int j = 0; j <= s1.size(); j++) {
      if (s1[j] == s2[j + i]) {
        x++;
      } else {
        if (x == s1.size()) return 1;
        break;
      }
      if (x == s1.size()) return 1;
    }
  }
  return 0;
}
int main() {
  int i, j, k, n, count = 0;
  cin >> n;
  vector<pair<int, string> > v;
  string s;
  for (i = 0; i < n; i++) {
    cin >> s;
    v.push_back(make_pair(s.size(), s));
  }
  sort(v.begin(), v.end());
  for (i = 0; i < n - 1; i++) {
    if (!substr(v[i].second, v[i + 1].second)) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES\n";
  for (i = 0; i < n; i++) cout << v[i].second << "\n";
}

```