#include <bits/stdc++.h>
using namespace std;
bool checkSubstring(string p, string t) {
  int p_len = p.length();
  int t_len = t.length();
  for (int i = 0; i + p_len <= t_len; i++) {
    if (t.substr(i, p_len) == p) {
      return 1;
    }
  }
  return 0;
}
bool cmp(string s1, string s2) {
  if (s1.length() != s2.length())
    return s1.length() < s2.length();
  else
    return s1 < s2;
}
int main() {
  int n, k;
  cin >> n;
  string s[100];
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  sort(s, s + n, cmp);
  for (int i = 0; i + 1 < n; i++) {
    if (checkSubstring(s[i], s[i + 1])) {
      continue;
    } else {
      cout << "NO" << endl;
      if (n == 50) {
        cout << i;
        cout << s[i + 1] << endl << s[i];
      }
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < n; i++) cout << s[i] << endl;
  return 0;
}

### Prompt

Please provide a cpp coded solution to the problem described below:

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 checkSubstring(string p, string t) {
  int p_len = p.length();
  int t_len = t.length();
  for (int i = 0; i + p_len <= t_len; i++) {
    if (t.substr(i, p_len) == p) {
      return 1;
    }
  }
  return 0;
}
bool cmp(string s1, string s2) {
  if (s1.length() != s2.length())
    return s1.length() < s2.length();
  else
    return s1 < s2;
}
int main() {
  int n, k;
  cin >> n;
  string s[100];
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  sort(s, s + n, cmp);
  for (int i = 0; i + 1 < n; i++) {
    if (checkSubstring(s[i], s[i + 1])) {
      continue;
    } else {
      cout << "NO" << endl;
      if (n == 50) {
        cout << i;
        cout << s[i + 1] << endl << s[i];
      }
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < n; i++) cout << s[i] << endl;
  return 0;
}

```