#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, s = 0, cc = 0;
  string a[107], x = "";
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    if (a[i].size() >= s) {
      s = a[i].size();
      x = a[i];
    }
  }
  for (int c = 0; c < n - 1; c++) {
    for (int d = 0; d < n - c - 1; d++) {
      if (a[d].size() > a[d + 1].size()) {
        string swa = a[d];
        a[d] = a[d + 1];
        a[d + 1] = swa;
      }
    }
  }
  for (int i = 1; i < n; ++i) {
    int pos = a[i].find(a[i - 1]);
    if (pos != string::npos) {
      continue;
    } else {
      printf("NO\n");
      return 0;
    }
  }
  printf("YES\n");
  for (int i = 0; i < n; ++i) {
    cout << a[i] << endl;
  }
}

### Prompt

Generate 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() {
  int n, s = 0, cc = 0;
  string a[107], x = "";
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    if (a[i].size() >= s) {
      s = a[i].size();
      x = a[i];
    }
  }
  for (int c = 0; c < n - 1; c++) {
    for (int d = 0; d < n - c - 1; d++) {
      if (a[d].size() > a[d + 1].size()) {
        string swa = a[d];
        a[d] = a[d + 1];
        a[d + 1] = swa;
      }
    }
  }
  for (int i = 1; i < n; ++i) {
    int pos = a[i].find(a[i - 1]);
    if (pos != string::npos) {
      continue;
    } else {
      printf("NO\n");
      return 0;
    }
  }
  printf("YES\n");
  for (int i = 0; i < n; ++i) {
    cout << a[i] << endl;
  }
}

```