#include <bits/stdc++.h>
using namespace std;
struct Node {
  string s;
  int l;
} ss[300];
bool cmp(const Node &a, const Node &b) { return (a.l < b.l); }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    cin >> ss[i].s;
    ss[i].l = ss[i].s.size();
  }
  sort(ss + 1, ss + n + 1, cmp);
  int k = 0;
  for (int i = 2; i <= n; i++) {
    string::size_type idx = ss[i].s.find(ss[i - 1].s);
    if (idx == string::npos) {
      k = 1;
      break;
    }
  }
  if (k == 1)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (int i = 1; i <= n; i++) {
      cout << ss[i].s << endl;
    }
  }
}

### Prompt

Develop a solution in CPP to the problem described below:

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 Node {
  string s;
  int l;
} ss[300];
bool cmp(const Node &a, const Node &b) { return (a.l < b.l); }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    cin >> ss[i].s;
    ss[i].l = ss[i].s.size();
  }
  sort(ss + 1, ss + n + 1, cmp);
  int k = 0;
  for (int i = 2; i <= n; i++) {
    string::size_type idx = ss[i].s.find(ss[i - 1].s);
    if (idx == string::npos) {
      k = 1;
      break;
    }
  }
  if (k == 1)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (int i = 1; i <= n; i++) {
      cout << ss[i].s << endl;
    }
  }
}

```