#include <bits/stdc++.h>
using namespace std;
bool cmp(string a, string b) { return a.length() < b.length(); }
bool subcheck(string s1, string s2) {
  long long i, j = 0, len = 0;
  for (i = 0; i <= s1.length() - s2.length(); i++) {
    len = 0;
    for (j = 0; j < s2.length(); j++) {
      if (s1[i + j] == s2[j]) len++;
    }
    if (len == s2.length()) return true;
  }
  return false;
}
int main() {
  long long n, i, j, flag = 1;
  cin >> n;
  vector<string> s(n);
  for (i = 0; i < n; i++) cin >> s[i];
  sort(s.begin(), s.end(), cmp);
  for (i = 1; i < n; i++) {
    if (!subcheck(s[i], s[i - 1])) {
      flag = 0;
      break;
    }
  }
  if (flag == 0)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (i = 0; i < n; i++) cout << s[i] << endl;
  }
}

### Prompt

In CPP, your task is to solve 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;
bool cmp(string a, string b) { return a.length() < b.length(); }
bool subcheck(string s1, string s2) {
  long long i, j = 0, len = 0;
  for (i = 0; i <= s1.length() - s2.length(); i++) {
    len = 0;
    for (j = 0; j < s2.length(); j++) {
      if (s1[i + j] == s2[j]) len++;
    }
    if (len == s2.length()) return true;
  }
  return false;
}
int main() {
  long long n, i, j, flag = 1;
  cin >> n;
  vector<string> s(n);
  for (i = 0; i < n; i++) cin >> s[i];
  sort(s.begin(), s.end(), cmp);
  for (i = 1; i < n; i++) {
    if (!subcheck(s[i], s[i - 1])) {
      flag = 0;
      break;
    }
  }
  if (flag == 0)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (i = 0; i < n; i++) cout << s[i] << endl;
  }
}

```