#include <bits/stdc++.h>
using namespace std;
long long i, j, k, l, n, m, flag;
string a[109];
bool cmp(string a, string b) {
  if (a.length() < b.length())
    return true;
  else
    return false;
}
bool check(string a, string b) {
  if (a.length() == b.length()) {
    if (a == b)
      return true;
    else
      return false;
  }
  if (b.find(a) == -1) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + n, cmp);
  for (i = 1; i < n; i++) {
    if (!check(a[i], a[i + 1])) {
      cout << "NO" << endl;
      exit(0);
    }
  }
  cout << "YES" << endl;
  for (i = 1; i <= n; i++) cout << a[i] << endl;
  exit(0);
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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;
long long i, j, k, l, n, m, flag;
string a[109];
bool cmp(string a, string b) {
  if (a.length() < b.length())
    return true;
  else
    return false;
}
bool check(string a, string b) {
  if (a.length() == b.length()) {
    if (a == b)
      return true;
    else
      return false;
  }
  if (b.find(a) == -1) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + n, cmp);
  for (i = 1; i < n; i++) {
    if (!check(a[i], a[i + 1])) {
      cout << "NO" << endl;
      exit(0);
    }
  }
  cout << "YES" << endl;
  for (i = 1; i <= n; i++) cout << a[i] << endl;
  exit(0);
}

```