#include <bits/stdc++.h>
using namespace std;
struct compare {
  bool operator()(const std::string& first, const std::string& second) {
    return first.size() < second.size();
  }
};
int main(int argc, char* argv[]) {
  int n, k;
  vector<string> str;
  string dummy, str1, str2;
  compare c;
  cin >> n;
  getline(cin, dummy);
  for (int i = 0; i < n; i++) {
    getline(cin, dummy);
    str.push_back(dummy);
  }
  sort(str.begin(), str.end(), c);
  if (n == 1) {
    cout << "YES" << endl;
    cout << str[0];
    return 0;
  } else {
    for (k = 1; k < n; k++) {
      str2 = str[k];
      str1 = str[k - 1];
      size_t found = str2.find(str1);
      if (found != std::string::npos)
        continue;
      else
        break;
    }
    if (k == n) {
      cout << "YES" << endl;
      for (int i = 0; i < n; i++) cout << str[i] << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}

### Prompt

Construct a cpp code solution to the problem outlined:

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;
struct compare {
  bool operator()(const std::string& first, const std::string& second) {
    return first.size() < second.size();
  }
};
int main(int argc, char* argv[]) {
  int n, k;
  vector<string> str;
  string dummy, str1, str2;
  compare c;
  cin >> n;
  getline(cin, dummy);
  for (int i = 0; i < n; i++) {
    getline(cin, dummy);
    str.push_back(dummy);
  }
  sort(str.begin(), str.end(), c);
  if (n == 1) {
    cout << "YES" << endl;
    cout << str[0];
    return 0;
  } else {
    for (k = 1; k < n; k++) {
      str2 = str[k];
      str1 = str[k - 1];
      size_t found = str2.find(str1);
      if (found != std::string::npos)
        continue;
      else
        break;
    }
    if (k == n) {
      cout << "YES" << endl;
      for (int i = 0; i < n; i++) cout << str[i] << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}

```