#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, j, f, t;
  string s;
  set<string> x[101];
  map<string, int> m;
  vector<string> v;
  cin >> t;
  while (t--) {
    cin >> s;
    x[s.length()].insert(s);
    m[s]++;
  }
  for (i = 1; i <= 100; i++) {
    if (x[i].size() > 1) {
      cout << "NO";
      return 0;
    }
  }
  for (i = 1; i <= 100; i++) {
    if (x[i].size() > 0) v.push_back(*x[i].begin());
  }
  for (i = 0; i < (v.size() - 1); i++) {
    f = 0;
    for (j = 0; j <= (v[i + 1].length() - v[i].length()); j++) {
      if (v[i + 1].substr(j, v[i].length()) == v[i]) {
        f = 1;
        break;
      }
    }
    if (f == 0) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES\n";
  for (i = 0; i < v.size(); i++) {
    for (j = 0; j < m[v[i]]; j++) cout << v[i] << "\n";
  }
  return 0;
}

### Prompt

Generate 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;
int main() {
  int i, j, f, t;
  string s;
  set<string> x[101];
  map<string, int> m;
  vector<string> v;
  cin >> t;
  while (t--) {
    cin >> s;
    x[s.length()].insert(s);
    m[s]++;
  }
  for (i = 1; i <= 100; i++) {
    if (x[i].size() > 1) {
      cout << "NO";
      return 0;
    }
  }
  for (i = 1; i <= 100; i++) {
    if (x[i].size() > 0) v.push_back(*x[i].begin());
  }
  for (i = 0; i < (v.size() - 1); i++) {
    f = 0;
    for (j = 0; j <= (v[i + 1].length() - v[i].length()); j++) {
      if (v[i + 1].substr(j, v[i].length()) == v[i]) {
        f = 1;
        break;
      }
    }
    if (f == 0) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES\n";
  for (i = 0; i < v.size(); i++) {
    for (j = 0; j < m[v[i]]; j++) cout << v[i] << "\n";
  }
  return 0;
}

```