#include <bits/stdc++.h>
using namespace std;
long long bigmod(long long n, long long p) {
  if (p == 0) return 1;
  if (p == 1) return (n + (long long)1e9 + 7) % (long long)1e9 + 7;
  if (p % 2)
    return (bigmod(n, p - 1) * n + (long long)1e9 + 7) % (long long)1e9 + 7;
  else {
    long long x = bigmod(n, p / 2);
    return (x * x + (long long)1e9 + 7) % (long long)1e9 + 7;
  }
}
long long modinverse(long long n) {
  return bigmod(n, (long long)1e9 + 7 - 2) % (long long)1e9 + 7;
}
long long isSubstring(string s1, string s2) {
  long long m = s1.length();
  long long n = s2.length();
  for (long long i = 0; i <= n - m; i++) {
    long long j;
    for (j = 0; j < m; j++)
      if (s2[i + j] != s1[j]) break;
    if (j == m) return i + 3;
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long n;
  cin >> n;
  vector<string> s(n);
  for (long long j = 0; j < n; j++) cin >> s[j];
  sort(s.begin(), s.end(),
       [&](const string &s, const string &t) { return s.size() < t.size(); });
  for (long long i = s.size() - 1; i > 0; i--) {
    if (isSubstring(s[i - 1], s[i]) == -1) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  for (auto it : s) cout << it << 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;
long long bigmod(long long n, long long p) {
  if (p == 0) return 1;
  if (p == 1) return (n + (long long)1e9 + 7) % (long long)1e9 + 7;
  if (p % 2)
    return (bigmod(n, p - 1) * n + (long long)1e9 + 7) % (long long)1e9 + 7;
  else {
    long long x = bigmod(n, p / 2);
    return (x * x + (long long)1e9 + 7) % (long long)1e9 + 7;
  }
}
long long modinverse(long long n) {
  return bigmod(n, (long long)1e9 + 7 - 2) % (long long)1e9 + 7;
}
long long isSubstring(string s1, string s2) {
  long long m = s1.length();
  long long n = s2.length();
  for (long long i = 0; i <= n - m; i++) {
    long long j;
    for (j = 0; j < m; j++)
      if (s2[i + j] != s1[j]) break;
    if (j == m) return i + 3;
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long n;
  cin >> n;
  vector<string> s(n);
  for (long long j = 0; j < n; j++) cin >> s[j];
  sort(s.begin(), s.end(),
       [&](const string &s, const string &t) { return s.size() < t.size(); });
  for (long long i = s.size() - 1; i > 0; i--) {
    if (isSubstring(s[i - 1], s[i]) == -1) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  for (auto it : s) cout << it << endl;
}

```