#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e5 + 4;
bool cmp(const pair<string, int> &a, const pair<string, int> &b) {
  if (a.second < b.second)
    return true;
  else
    return false;
}
int isSubstring(string s1, string s2) {
  int M = s1.length();
  int N = s2.length();
  for (int i = 0; i <= N - M; i++) {
    int j;
    for (j = 0; j < M; j++)
      if (s2[i + j] != s1[j]) break;
    if (j == M) return i;
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, string> > v;
  for (int i = 0; i < n; i++) {
    string st;
    cin >> st;
    v.push_back({st.size(), st});
  }
  sort(v.begin(), v.end());
  int x = 0;
  for (int i = 0; i < n - 1; i++) {
    int res = isSubstring(v[i].second, v[i + 1].second);
    if (res != -1) {
      x = 1;
    } else {
      x = 0;
      break;
    }
  }
  if (x == 0 && n != 1)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (int i = 0; i < n; i++) {
      cout << v[i].second << "\n";
    }
  }
}

### Prompt

Your challenge is to write 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 = 1e9 + 7;
const int N = 1e5 + 4;
bool cmp(const pair<string, int> &a, const pair<string, int> &b) {
  if (a.second < b.second)
    return true;
  else
    return false;
}
int isSubstring(string s1, string s2) {
  int M = s1.length();
  int N = s2.length();
  for (int i = 0; i <= N - M; i++) {
    int j;
    for (j = 0; j < M; j++)
      if (s2[i + j] != s1[j]) break;
    if (j == M) return i;
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, string> > v;
  for (int i = 0; i < n; i++) {
    string st;
    cin >> st;
    v.push_back({st.size(), st});
  }
  sort(v.begin(), v.end());
  int x = 0;
  for (int i = 0; i < n - 1; i++) {
    int res = isSubstring(v[i].second, v[i + 1].second);
    if (res != -1) {
      x = 1;
    } else {
      x = 0;
      break;
    }
  }
  if (x == 0 && n != 1)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (int i = 0; i < n; i++) {
      cout << v[i].second << "\n";
    }
  }
}

```