#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000 * 1000 + 10;
bool mark[MAXN];
long long int a[MAXN];
long long int b[MAXN];
string s[MAXN];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (s[i].size() > s[j].size()) {
        string t = s[i];
        s[i] = s[j];
        s[j] = t;
      }
    }
  }
  bool f = false;
  for (int i = 0; i < n - 1; i++) {
    f = false;
    for (int j = 0; j <= s[i + 1].size() - s[i].size(); j++) {
      bool b = true;
      for (int k = 0; k < s[i].size(); k++) {
        if (s[i + 1][j + k] != s[i][k]) {
          b = false;
          break;
        }
      }
      if (b) {
        f = true;
        break;
      }
    }
    if (!f) {
      break;
    }
  }
  if (f || n == 1) {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) {
      cout << s[i] << endl;
    }
  } else {
    cout << "NO" << endl;
  }
  return 0;
}

### Prompt

Please create a solution in Cpp 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;
const int MAXN = 1000 * 1000 + 10;
bool mark[MAXN];
long long int a[MAXN];
long long int b[MAXN];
string s[MAXN];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (s[i].size() > s[j].size()) {
        string t = s[i];
        s[i] = s[j];
        s[j] = t;
      }
    }
  }
  bool f = false;
  for (int i = 0; i < n - 1; i++) {
    f = false;
    for (int j = 0; j <= s[i + 1].size() - s[i].size(); j++) {
      bool b = true;
      for (int k = 0; k < s[i].size(); k++) {
        if (s[i + 1][j + k] != s[i][k]) {
          b = false;
          break;
        }
      }
      if (b) {
        f = true;
        break;
      }
    }
    if (!f) {
      break;
    }
  }
  if (f || n == 1) {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) {
      cout << s[i] << endl;
    }
  } else {
    cout << "NO" << endl;
  }
  return 0;
}

```