#include <bits/stdc++.h>
using namespace std;
bool debug = 1;
const int N = -1;
vector<string> v;
bool issub(string a, string b) {
  for (int i = 0; i < b.size() - a.size() + 1; i++) {
    int cur = 1;
    for (int j = 0; j < a.size(); j++) {
      if (a[j] != b[i + j]) cur = 0;
    }
    if (cur) return 1;
  }
  return 0;
}
struct cmp {
  bool operator()(const string &a, const string &b) {
    return a.size() < b.size();
  }
};
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    v.push_back(s);
  }
  int ok = 1;
  sort((v).begin(), (v).end(), cmp());
  for (int i = 0; i < v.size(); i++) {
    if (i) {
      if (!issub(v[i - 1], v[i])) ok = 0;
    }
  }
  if (ok) {
    puts("YES");
    for (auto &s : v) cout << s << endl;
  } else
    puts("NO");
  return 0;
}

### Prompt

Create a solution in CPP for 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 debug = 1;
const int N = -1;
vector<string> v;
bool issub(string a, string b) {
  for (int i = 0; i < b.size() - a.size() + 1; i++) {
    int cur = 1;
    for (int j = 0; j < a.size(); j++) {
      if (a[j] != b[i + j]) cur = 0;
    }
    if (cur) return 1;
  }
  return 0;
}
struct cmp {
  bool operator()(const string &a, const string &b) {
    return a.size() < b.size();
  }
};
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    v.push_back(s);
  }
  int ok = 1;
  sort((v).begin(), (v).end(), cmp());
  for (int i = 0; i < v.size(); i++) {
    if (i) {
      if (!issub(v[i - 1], v[i])) ok = 0;
    }
  }
  if (ok) {
    puts("YES");
    for (auto &s : v) cout << s << endl;
  } else
    puts("NO");
  return 0;
}

```