#include <bits/stdc++.h>
using namespace std;
vector<string> v;
map<string, int> mp;
bool comp(string &s1, string &s2) { return s1.length() < s2.length(); }
int main() {
  ios_base::sync_with_stdio(0);
  ;
  cin.tie(0);
  cout.tie(0);
  int n, i;
  cin >> n;
  for (i = 0; i < n; i++) {
    string str;
    cin >> str;
    if (!mp[str]) v.push_back(str);
    mp[str]++;
  }
  sort(v.begin(), v.end(), comp);
  bool f = 0;
  for (i = 1; i < v.size(); i++) {
    int j, k;
    bool fl = 0;
    string s1 = v[i], s2 = v[i - 1];
    if (s1.length() == s2.length()) {
      cout << "NO";
      return 0;
    }
    for (j = 0; j < s1.length() - s2.length() + 1; j++) {
      if (s1[j] != s2[0]) continue;
      k = j;
      int c = 0;
      while (c < s2.length() && k < s1.length()) {
        if (s1[k] != s2[c]) break;
        k++, c++;
      }
      if (c == s2.length()) {
        fl = 1;
        break;
      }
    }
    if (!fl) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES\n";
  int j;
  for (i = 0; i < v.size(); i++) {
    for (j = 0; j < mp[v[i]]; j++) cout << v[i] << "\n";
  }
  return 0;
}

### Prompt

Generate 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;
vector<string> v;
map<string, int> mp;
bool comp(string &s1, string &s2) { return s1.length() < s2.length(); }
int main() {
  ios_base::sync_with_stdio(0);
  ;
  cin.tie(0);
  cout.tie(0);
  int n, i;
  cin >> n;
  for (i = 0; i < n; i++) {
    string str;
    cin >> str;
    if (!mp[str]) v.push_back(str);
    mp[str]++;
  }
  sort(v.begin(), v.end(), comp);
  bool f = 0;
  for (i = 1; i < v.size(); i++) {
    int j, k;
    bool fl = 0;
    string s1 = v[i], s2 = v[i - 1];
    if (s1.length() == s2.length()) {
      cout << "NO";
      return 0;
    }
    for (j = 0; j < s1.length() - s2.length() + 1; j++) {
      if (s1[j] != s2[0]) continue;
      k = j;
      int c = 0;
      while (c < s2.length() && k < s1.length()) {
        if (s1[k] != s2[c]) break;
        k++, c++;
      }
      if (c == s2.length()) {
        fl = 1;
        break;
      }
    }
    if (!fl) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES\n";
  int j;
  for (i = 0; i < v.size(); i++) {
    for (j = 0; j < mp[v[i]]; j++) cout << v[i] << "\n";
  }
  return 0;
}

```