#include <bits/stdc++.h>
using namespace std;
int n;
string str[105];
bool cmp(string a, string b) { return a.length() < b.length(); }
int main() {
  bool f1 = 0, f = 1;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) cin >> str[i];
  sort(str, str + n, cmp);
  for (int i = 0; i < n - 1; ++i) {
    int len = str[i + 1].length(), l = str[i].length();
    f1 = 0;
    for (int j = 0; j < len - l + 1; ++j) {
      f = 1;
      for (int k = 0; k < l; ++k)
        if (str[i][k] != str[i + 1][j + k]) {
          f = 0;
          break;
        }
      if (f) {
        f1 = 1;
        break;
      }
    }
    if (!f1) return printf("NO\n"), 0;
  }
  printf("YES\n");
  for (int i = 0; i < n; ++i) cout << str[i] << 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;
int n;
string str[105];
bool cmp(string a, string b) { return a.length() < b.length(); }
int main() {
  bool f1 = 0, f = 1;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) cin >> str[i];
  sort(str, str + n, cmp);
  for (int i = 0; i < n - 1; ++i) {
    int len = str[i + 1].length(), l = str[i].length();
    f1 = 0;
    for (int j = 0; j < len - l + 1; ++j) {
      f = 1;
      for (int k = 0; k < l; ++k)
        if (str[i][k] != str[i + 1][j + k]) {
          f = 0;
          break;
        }
      if (f) {
        f1 = 1;
        break;
      }
    }
    if (!f1) return printf("NO\n"), 0;
  }
  printf("YES\n");
  for (int i = 0; i < n; ++i) cout << str[i] << endl;
  return 0;
}

```