#include <bits/stdc++.h>
using namespace std;
int a[10000007];
long long int c1 = 0;
vector<int> v2;
long long int p;
int flag = 0;
bool cmp(string s, string p) {
  if (s.length() == p.length()) return s < p;
  return s.length() < p.length();
}
int main() {
  long long int k, x, y;
  x = -1;
  int n;
  int c = 0;
  int c1 = 0;
  cin >> n;
  string s[n];
  for (int i = 1; i <= n; i++) {
    cin >> s[i - 1];
  }
  sort(s, s + n, cmp);
  int flag = 1;
  for (int i = 1; i < n; i++) {
    if (s[i].length() == s[i - 1].length()) {
      if (s[i] != s[i - 1]) flag = 0;
    }
  }
  if (flag) {
    string d = s[n - 1];
    for (int i = 1; i < n; i++) {
      int flag = 0;
      for (int j = 1; j <= s[i].length(); j++) {
        string c1 = "\0";
        c1 += s[i][j - 1];
        if (c1 == s[i - 1]) {
          flag = 1;
          break;
        }
        for (int k = j + 1; k <= s[i].length(); k++) {
          c1 += s[i][k - 1];
          if (c1 == s[i - 1]) flag = 1;
        }
      }
      if (flag == 0) return cout << "NO", 0;
    }
    cout << "YES\n";
    for (int i = 1; i <= n; i++) cout << s[i - 1] << endl;
  } else
    cout << "NO\n";
}

### 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;
int a[10000007];
long long int c1 = 0;
vector<int> v2;
long long int p;
int flag = 0;
bool cmp(string s, string p) {
  if (s.length() == p.length()) return s < p;
  return s.length() < p.length();
}
int main() {
  long long int k, x, y;
  x = -1;
  int n;
  int c = 0;
  int c1 = 0;
  cin >> n;
  string s[n];
  for (int i = 1; i <= n; i++) {
    cin >> s[i - 1];
  }
  sort(s, s + n, cmp);
  int flag = 1;
  for (int i = 1; i < n; i++) {
    if (s[i].length() == s[i - 1].length()) {
      if (s[i] != s[i - 1]) flag = 0;
    }
  }
  if (flag) {
    string d = s[n - 1];
    for (int i = 1; i < n; i++) {
      int flag = 0;
      for (int j = 1; j <= s[i].length(); j++) {
        string c1 = "\0";
        c1 += s[i][j - 1];
        if (c1 == s[i - 1]) {
          flag = 1;
          break;
        }
        for (int k = j + 1; k <= s[i].length(); k++) {
          c1 += s[i][k - 1];
          if (c1 == s[i - 1]) flag = 1;
        }
      }
      if (flag == 0) return cout << "NO", 0;
    }
    cout << "YES\n";
    for (int i = 1; i <= n; i++) cout << s[i - 1] << endl;
  } else
    cout << "NO\n";
}

```