#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
  int n;
  cin >> n;
  string str[n];
  int hash2[101][2] = {0};
  for (int i = 0; i < n; ++i) {
    cin >> str[i];
    ++hash2[(str[i]).length()][0];
    if (hash2[(str[i]).length()][0] > 1) {
      if (str[i] != str[hash2[(str[i]).length()][1]]) {
        cout << "NO";
        return 0;
      }
    }
    hash2[(str[i]).length()][1] = i;
  }
  int string1, string2;
  int i = 1;
  while (i < 101) {
    if (hash2[i][0] > 0) {
      int j = i + 1;
      while (j < 101) {
        if (hash2[j][0] > 0) {
          if (str[hash2[j][1]].find(str[hash2[i][1]]) == std::string::npos) {
            cout << "NO";
            return 0;
          } else {
            break;
          }
        }
        ++j;
      }
    }
    ++i;
  }
  cout << "YES" << endl;
  for (int i = 1; i < 101; ++i) {
    if (hash2[i][0] > 0) {
      for (int j = 0; j < hash2[i][0]; j++) {
        cout << str[hash2[i][1]] << endl;
      }
    }
  }
  return 0;
}

### Prompt

In CPP, your task is to solve 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 argc, char const *argv[]) {
  int n;
  cin >> n;
  string str[n];
  int hash2[101][2] = {0};
  for (int i = 0; i < n; ++i) {
    cin >> str[i];
    ++hash2[(str[i]).length()][0];
    if (hash2[(str[i]).length()][0] > 1) {
      if (str[i] != str[hash2[(str[i]).length()][1]]) {
        cout << "NO";
        return 0;
      }
    }
    hash2[(str[i]).length()][1] = i;
  }
  int string1, string2;
  int i = 1;
  while (i < 101) {
    if (hash2[i][0] > 0) {
      int j = i + 1;
      while (j < 101) {
        if (hash2[j][0] > 0) {
          if (str[hash2[j][1]].find(str[hash2[i][1]]) == std::string::npos) {
            cout << "NO";
            return 0;
          } else {
            break;
          }
        }
        ++j;
      }
    }
    ++i;
  }
  cout << "YES" << endl;
  for (int i = 1; i < 101; ++i) {
    if (hash2[i][0] > 0) {
      for (int j = 0; j < hash2[i][0]; j++) {
        cout << str[hash2[i][1]] << endl;
      }
    }
  }
  return 0;
}

```