#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &x) {
  char c;
  int flag = 1;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') flag *= -1;
  x = c - '0';
  while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + c - '0';
  x *= flag;
  return;
}
bool cmp(string a, string b) {
  if (a.length() == b.length())
    return a < b;
  else
    return a.length() < b.length();
}
vector<string> v;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    string a;
    cin >> a;
    v.push_back(a);
  }
  sort(v.begin(), v.end(), cmp);
  bool ok = 1;
  for (int i = 0; i < n - 1; ++i) {
    if (v[i].length() == v[i + 1].length() && v[i] != v[i + 1]) ok = false;
    int pos = v[i + 1].find(v[i]);
    if (pos == string::npos) ok = false;
  }
  if (ok) {
    cout << "YES\n";
    for (int i = 0; i < n; ++i) cout << v[i] << endl;
  } else
    cout << "NO\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;
template <class T>
inline void read(T &x) {
  char c;
  int flag = 1;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') flag *= -1;
  x = c - '0';
  while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + c - '0';
  x *= flag;
  return;
}
bool cmp(string a, string b) {
  if (a.length() == b.length())
    return a < b;
  else
    return a.length() < b.length();
}
vector<string> v;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    string a;
    cin >> a;
    v.push_back(a);
  }
  sort(v.begin(), v.end(), cmp);
  bool ok = 1;
  for (int i = 0; i < n - 1; ++i) {
    if (v[i].length() == v[i + 1].length() && v[i] != v[i + 1]) ok = false;
    int pos = v[i + 1].find(v[i]);
    if (pos == string::npos) ok = false;
  }
  if (ok) {
    cout << "YES\n";
    for (int i = 0; i < n; ++i) cout << v[i] << endl;
  } else
    cout << "NO\n";
}

```