#include <bits/stdc++.h>
using namespace std;
bool is_substring(string s1, string s2) {
  for (int i = 0; i <= (s1.size() - s2.size()); i++) {
    if (s1.substr(i, s2.size()) == s2) return true;
  }
  return false;
}
void solution() {
  long long int n;
  string s;
  cin >> n;
  vector<pair<int, string> > mpp;
  for (int i = 0; i < n; i++) {
    cin >> s;
    mpp.push_back(make_pair(s.size(), s));
  }
  sort((mpp).begin(), (mpp).end());
  for (int j = 0; j < mpp.size() - 1; j++) {
    if (is_substring(mpp[j + 1].second, mpp[j].second) == false) {
      cout << "NO";
      return;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < mpp.size(); i++) {
    cout << mpp[i].second << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long int t;
  t = 1;
  while (t--) {
    solution();
    cout << "\n";
  }
}

### 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;
bool is_substring(string s1, string s2) {
  for (int i = 0; i <= (s1.size() - s2.size()); i++) {
    if (s1.substr(i, s2.size()) == s2) return true;
  }
  return false;
}
void solution() {
  long long int n;
  string s;
  cin >> n;
  vector<pair<int, string> > mpp;
  for (int i = 0; i < n; i++) {
    cin >> s;
    mpp.push_back(make_pair(s.size(), s));
  }
  sort((mpp).begin(), (mpp).end());
  for (int j = 0; j < mpp.size() - 1; j++) {
    if (is_substring(mpp[j + 1].second, mpp[j].second) == false) {
      cout << "NO";
      return;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < mpp.size(); i++) {
    cout << mpp[i].second << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long int t;
  t = 1;
  while (t--) {
    solution();
    cout << "\n";
  }
}

```