#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<string> v;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    v.push_back(s);
  }
  if (n > 1) {
    int arr[n];
    int a[n];
    for (int i = 0; i < n; i++) {
      arr[i] = v[i].length();
      a[i] = arr[i];
    }
    sort(a, a + n);
    vector<string> v2;
    vector<int> v1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        int p = 0;
        if (a[i] == v[j].length()) {
          for (int k = 0; k < v1.size(); k++) {
            if (v1[k] == j) {
              p++;
              break;
            }
          }
          if (p == 1) continue;
          v2.push_back(v[j]);
          v1.push_back(j);
          break;
        }
      }
    }
    int t = 0;
    for (int i = 0; i < n - 1; i++)
      for (int j = 0; j <= v2[i + 1].length() - v2[i].length(); j++) {
        if (v2[i + 1].substr(j, v2[i].length()) == v2[i]) {
          t++;
          break;
        }
      }
    if (t == n - 1) {
      cout << "YES" << endl;
      for (int i = 0; i < n; i++) cout << v2[i] << endl;
    } else
      cout << "NO";
  } else
    cout << "YES" << endl << v[0];
  return 0;
}

### Prompt

Create a solution in CPP for 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;
  cin >> n;
  vector<string> v;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    v.push_back(s);
  }
  if (n > 1) {
    int arr[n];
    int a[n];
    for (int i = 0; i < n; i++) {
      arr[i] = v[i].length();
      a[i] = arr[i];
    }
    sort(a, a + n);
    vector<string> v2;
    vector<int> v1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        int p = 0;
        if (a[i] == v[j].length()) {
          for (int k = 0; k < v1.size(); k++) {
            if (v1[k] == j) {
              p++;
              break;
            }
          }
          if (p == 1) continue;
          v2.push_back(v[j]);
          v1.push_back(j);
          break;
        }
      }
    }
    int t = 0;
    for (int i = 0; i < n - 1; i++)
      for (int j = 0; j <= v2[i + 1].length() - v2[i].length(); j++) {
        if (v2[i + 1].substr(j, v2[i].length()) == v2[i]) {
          t++;
          break;
        }
      }
    if (t == n - 1) {
      cout << "YES" << endl;
      for (int i = 0; i < n; i++) cout << v2[i] << endl;
    } else
      cout << "NO";
  } else
    cout << "YES" << endl << v[0];
  return 0;
}

```