#include <bits/stdc++.h>
using namespace std;
const int mod = (int)(1e8);
const long long int pINF = (long long int)(1e15);
const long long int nINF = -LLONG_MAX;
void fast() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b != 0) {
    if (b % 2 == 1) {
      ans *= a;
    }
    b /= 2;
    a *= a;
  }
  return ans;
}
long long int invmod(long long int a) { return pow(a, mod - 2); }
const int INT = 1000000000;
const int INF = 0x3f3f3f3f;
void print(int a[], int n) {
  for (int i = 0; i < n; i++) cout << a[i] << " ";
}
vector<string> s;
bool cmp(string a, string b) { return (int)a.size() < (int)b.size(); }
bool ok(string a, string b) {
  int found = b.find(a);
  if (found == string::npos) return false;
  return true;
}
int main() {
  int n;
  scanf("%d", &n);
  string ss;
  for (int i = 0; i < n; i++) {
    cin >> ss;
    s.push_back(ss);
  }
  if (n == 1) {
    cout << "YES\n";
    cout << s[0] << endl;
    return 0;
  }
  sort(s.begin(), s.end(), cmp);
  for (int i = 0; i < n - 1; i++) {
    if (!ok(s[i], s[i + 1])) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < n; i++) cout << s[i] << endl;
  return 0;
}

### 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>
using namespace std;
const int mod = (int)(1e8);
const long long int pINF = (long long int)(1e15);
const long long int nINF = -LLONG_MAX;
void fast() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b != 0) {
    if (b % 2 == 1) {
      ans *= a;
    }
    b /= 2;
    a *= a;
  }
  return ans;
}
long long int invmod(long long int a) { return pow(a, mod - 2); }
const int INT = 1000000000;
const int INF = 0x3f3f3f3f;
void print(int a[], int n) {
  for (int i = 0; i < n; i++) cout << a[i] << " ";
}
vector<string> s;
bool cmp(string a, string b) { return (int)a.size() < (int)b.size(); }
bool ok(string a, string b) {
  int found = b.find(a);
  if (found == string::npos) return false;
  return true;
}
int main() {
  int n;
  scanf("%d", &n);
  string ss;
  for (int i = 0; i < n; i++) {
    cin >> ss;
    s.push_back(ss);
  }
  if (n == 1) {
    cout << "YES\n";
    cout << s[0] << endl;
    return 0;
  }
  sort(s.begin(), s.end(), cmp);
  for (int i = 0; i < n - 1; i++) {
    if (!ok(s[i], s[i + 1])) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < n; i++) cout << s[i] << endl;
  return 0;
}

```