#include <bits/stdc++.h>
using namespace std;
bool IsSubString(string& s_main, string& s_sub) {
  int preI = -1;
  for (int i = 0, j = 0; i < s_main.length(); i++) {
    if (s_main[i] == s_sub[j]) {
      if (preI == -1) preI = i;
      j++;
      if (j == s_sub.length()) return true;
    } else if (preI != -1) {
      i = preI + 1;
      j = 0;
      preI = -1;
    }
  }
  return false;
}
int main() {
  string* strs = new string[100];
  int* qs = new int[100];
  for (int i = 0; i < 100; i++) {
    qs[i] = 0;
  }
  int n;
  cin >> n;
  string s;
  getline(cin, s);
  for (int i = 0; i < n; i++) {
    getline(cin, s);
    int j = s.length() - 1;
    if (qs[j] == 0) {
      strs[j] = s;
      qs[j]++;
    } else if (strs[j] == s) {
      qs[j]++;
    } else {
      cout << "NO" << endl;
      return 0;
    }
  }
  s = "0";
  for (int i = 0; i < 100; i++) {
    if (s != "0" && qs[i] != 0) {
      if (strs[i].find(s) == -1) {
        cout << "NO" << endl;
        return 0;
      }
      s = strs[i];
    }
    if (s == "0") {
      if (qs[i] != 0) s = strs[i];
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < 100; i++) {
    for (int j = 0; j < qs[i]; j++) {
      cout << strs[i] << endl;
    }
  }
}

### 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;
bool IsSubString(string& s_main, string& s_sub) {
  int preI = -1;
  for (int i = 0, j = 0; i < s_main.length(); i++) {
    if (s_main[i] == s_sub[j]) {
      if (preI == -1) preI = i;
      j++;
      if (j == s_sub.length()) return true;
    } else if (preI != -1) {
      i = preI + 1;
      j = 0;
      preI = -1;
    }
  }
  return false;
}
int main() {
  string* strs = new string[100];
  int* qs = new int[100];
  for (int i = 0; i < 100; i++) {
    qs[i] = 0;
  }
  int n;
  cin >> n;
  string s;
  getline(cin, s);
  for (int i = 0; i < n; i++) {
    getline(cin, s);
    int j = s.length() - 1;
    if (qs[j] == 0) {
      strs[j] = s;
      qs[j]++;
    } else if (strs[j] == s) {
      qs[j]++;
    } else {
      cout << "NO" << endl;
      return 0;
    }
  }
  s = "0";
  for (int i = 0; i < 100; i++) {
    if (s != "0" && qs[i] != 0) {
      if (strs[i].find(s) == -1) {
        cout << "NO" << endl;
        return 0;
      }
      s = strs[i];
    }
    if (s == "0") {
      if (qs[i] != 0) s = strs[i];
    }
  }
  cout << "YES" << endl;
  for (int i = 0; i < 100; i++) {
    for (int j = 0; j < qs[i]; j++) {
      cout << strs[i] << endl;
    }
  }
}

```