#include <bits/stdc++.h>
using namespace std;
bool subchk(string a, string b) {
  int f = a.length();
  int s = b.length();
  for (int i = 0; i < s; i++) {
    for (int j = 1; j <= s - i; j++) {
      string ss = b.substr(i, j);
      if (ss == a) return true;
    }
  }
  return false;
}
int main() {
  vector<pair<int, string> > mys;
  int input, sz = 0, a;
  string s, sec;
  cin >> input;
  for (int i = 0; i < input; i++) {
    cin >> s;
    a = s.size();
    if (a >= sz) {
      sec = s;
      sz = a;
    }
    mys.push_back(make_pair(a, s));
  }
  sort(mys.begin(), mys.end());
  int chk = 0;
  for (int i = 0; i < input - 1; i++) {
    if (subchk(mys[i].second, mys[i + 1].second) == true) chk++;
  }
  if (chk == input - 1) {
    cout << "YES" << endl;
    for (int i = 0; i < input; i++) cout << mys[i].second << 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;
bool subchk(string a, string b) {
  int f = a.length();
  int s = b.length();
  for (int i = 0; i < s; i++) {
    for (int j = 1; j <= s - i; j++) {
      string ss = b.substr(i, j);
      if (ss == a) return true;
    }
  }
  return false;
}
int main() {
  vector<pair<int, string> > mys;
  int input, sz = 0, a;
  string s, sec;
  cin >> input;
  for (int i = 0; i < input; i++) {
    cin >> s;
    a = s.size();
    if (a >= sz) {
      sec = s;
      sz = a;
    }
    mys.push_back(make_pair(a, s));
  }
  sort(mys.begin(), mys.end());
  int chk = 0;
  for (int i = 0; i < input - 1; i++) {
    if (subchk(mys[i].second, mys[i + 1].second) == true) chk++;
  }
  if (chk == input - 1) {
    cout << "YES" << endl;
    for (int i = 0; i < input; i++) cout << mys[i].second << endl;
  } else
    cout << "NO" << endl;
  return 0;
}

```