#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, i, j, k;
  cin >> n;
  vector<string> v;
  vector<pair<int, string> > v1;
  for (i = 0; i < n; i++) {
    string s;
    cin >> s;
    v.push_back(s);
    v1.push_back(make_pair(s.length(), s));
  }
  sort(v1.begin(), v1.end());
  int flag = 1;
  for (i = n - 1; i >= 0; i--) {
    pair<int, string> temp = v1[i];
    string s = temp.second;
    for (j = 0; j < i; j++) {
      pair<int, string> temp1 = v1[j];
      string s1 = temp1.second;
      if (s.length() != s1.length()) {
        if (s.find(s1) != std::string::npos)
          continue;
        else {
          flag = 0;
          break;
        }
      } else {
        if (s != s1) {
          flag = 0;
          break;
        }
      }
    }
    if (flag == 0) break;
  }
  if (flag == 0)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (i = 0; i < n; i++) cout << v1[i].second << "\n";
  }
  return 0;
}

### Prompt

Your task is to create 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() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, i, j, k;
  cin >> n;
  vector<string> v;
  vector<pair<int, string> > v1;
  for (i = 0; i < n; i++) {
    string s;
    cin >> s;
    v.push_back(s);
    v1.push_back(make_pair(s.length(), s));
  }
  sort(v1.begin(), v1.end());
  int flag = 1;
  for (i = n - 1; i >= 0; i--) {
    pair<int, string> temp = v1[i];
    string s = temp.second;
    for (j = 0; j < i; j++) {
      pair<int, string> temp1 = v1[j];
      string s1 = temp1.second;
      if (s.length() != s1.length()) {
        if (s.find(s1) != std::string::npos)
          continue;
        else {
          flag = 0;
          break;
        }
      } else {
        if (s != s1) {
          flag = 0;
          break;
        }
      }
    }
    if (flag == 0) break;
  }
  if (flag == 0)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (i = 0; i < n; i++) cout << v1[i].second << "\n";
  }
  return 0;
}

```