#include <bits/stdc++.h>
using namespace std;
struct node {
  string st;
  int l;
};
int n, k, cnt = 0, m;
node a[1000];
bool cmp(const node &x, const node &y) { return (x.l < y.l); }
bool substring(string s1, string s2) {
  for (int i = 0; i <= s2.length() - s1.length(); i++) {
    bool flag = 1;
    for (int j = 0; j < s1.length(); j++) {
      if (s2[i + j] != s1[j]) {
        flag = 0;
        break;
      }
    }
    if (flag) return 1;
  }
  return 0;
}
bool judge(void) {
  for (int i = 1; i < n; i++) {
    if (!substring(a[i].st, a[i + 1].st)) {
      return 0;
    }
  }
  return 1;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].st;
    a[i].l = a[i].st.length();
  }
  sort(a + 1, a + n + 1, cmp);
  if (judge()) {
    cout << "YES" << endl;
    for (int i = 1; i <= n; i++) {
      cout << a[i].st << endl;
    }
  } else {
    cout << "NO" << endl;
  }
  return 0;
}

### Prompt

Your task is to create 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;
struct node {
  string st;
  int l;
};
int n, k, cnt = 0, m;
node a[1000];
bool cmp(const node &x, const node &y) { return (x.l < y.l); }
bool substring(string s1, string s2) {
  for (int i = 0; i <= s2.length() - s1.length(); i++) {
    bool flag = 1;
    for (int j = 0; j < s1.length(); j++) {
      if (s2[i + j] != s1[j]) {
        flag = 0;
        break;
      }
    }
    if (flag) return 1;
  }
  return 0;
}
bool judge(void) {
  for (int i = 1; i < n; i++) {
    if (!substring(a[i].st, a[i + 1].st)) {
      return 0;
    }
  }
  return 1;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].st;
    a[i].l = a[i].st.length();
  }
  sort(a + 1, a + n + 1, cmp);
  if (judge()) {
    cout << "YES" << endl;
    for (int i = 1; i <= n; i++) {
      cout << a[i].st << endl;
    }
  } else {
    cout << "NO" << endl;
  }
  return 0;
}

```