#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
double pi = 3.1415926535898;
string ys = "Yes\n";
string no = "No\n";
const double EPS = 1e-6;
const int inf = 2e9;
const long long M = 1e9 + 7;
const int N = 100100;
int n;
string s[200];
pair<int, string> p[200];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cin >> n;
  for (int i = 1; i <= int(n); i++) cin >> s[i];
  for (int i = 1; i <= int(n); i++) {
    int cnt = 0;
    for (int j = 1; j <= int(n); j++) {
      if (i != j)
        if (s[j].find(s[i]) != string::npos) {
          cnt++;
        }
    }
    p[i] = {-cnt, s[i]};
  }
  sort(p + 1, p + n + 1);
  for (int i = 1; i <= int(n - 1); i++) {
    if (p[i + 1].second.find(p[i].second) == string::npos) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 1; i <= int(n); i++) {
    cout << p[i].second << endl;
  }
}

### Prompt

Please formulate a cpp solution 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>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
double pi = 3.1415926535898;
string ys = "Yes\n";
string no = "No\n";
const double EPS = 1e-6;
const int inf = 2e9;
const long long M = 1e9 + 7;
const int N = 100100;
int n;
string s[200];
pair<int, string> p[200];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cin >> n;
  for (int i = 1; i <= int(n); i++) cin >> s[i];
  for (int i = 1; i <= int(n); i++) {
    int cnt = 0;
    for (int j = 1; j <= int(n); j++) {
      if (i != j)
        if (s[j].find(s[i]) != string::npos) {
          cnt++;
        }
    }
    p[i] = {-cnt, s[i]};
  }
  sort(p + 1, p + n + 1);
  for (int i = 1; i <= int(n - 1); i++) {
    if (p[i + 1].second.find(p[i].second) == string::npos) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 1; i <= int(n); i++) {
    cout << p[i].second << endl;
  }
}

```