#include <bits/stdc++.h>
using namespace std;
int n;
string s[105];
int check(string a, string b) {
  if (a.length() < b.length()) return 0;
  for (int i = 0; i < a.length() && i + b.length() - 1 < a.length(); ++i) {
    int flag = 1;
    for (int j = 0; j < b.length(); ++j)
      if (a[i + j] != b[j]) {
        flag = 0;
        break;
      }
    if (flag) return 1;
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> s[i];
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      if (check(s[i], s[j]) == 1)
        swap(s[i], s[j]);
      else if (check(s[j], s[i]) == 0) {
        cout << "NO";
        return 0;
      }
    }
  cout << "YES\n";
  for (int i = n; i >= 1; --i) cout << s[i] << '\n';
}

### 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 n;
string s[105];
int check(string a, string b) {
  if (a.length() < b.length()) return 0;
  for (int i = 0; i < a.length() && i + b.length() - 1 < a.length(); ++i) {
    int flag = 1;
    for (int j = 0; j < b.length(); ++j)
      if (a[i + j] != b[j]) {
        flag = 0;
        break;
      }
    if (flag) return 1;
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> s[i];
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      if (check(s[i], s[j]) == 1)
        swap(s[i], s[j]);
      else if (check(s[j], s[i]) == 0) {
        cout << "NO";
        return 0;
      }
    }
  cout << "YES\n";
  for (int i = n; i >= 1; --i) cout << s[i] << '\n';
}

```