#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  string s[n];
  int a[n];
  for (int x = 0; x < n; x++) {
    cin >> s[x];
    a[x] = s[x].length();
  }
  for (int x = 0; x < n; x++) {
    for (int y = 0; y < n - 1; y++) {
      if (a[y] > a[y + 1]) {
        int t = a[y];
        a[y] = a[y + 1];
        a[y + 1] = t;
        string temp = s[y];
        s[y] = s[y + 1];
        s[y + 1] = temp;
      }
    }
  }
  int f = 0;
  for (int x = 0; x < n; x++) {
    int i;
    for (int y = x + 1; y < n; y++) {
      i = s[y].find(s[x], 0);
      if (i == -1) {
        f = 1;
        break;
      }
    }
    if (f == 1) {
      break;
    }
  }
  if (f == 1) {
    cout << "NO";
  } else {
    cout << "YES" << endl;
    for (int x = 0; x < n; x++) {
      cout << s[x] << endl;
    }
  }
}

### Prompt

Your challenge is to write 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;
int main() {
  int n;
  cin >> n;
  string s[n];
  int a[n];
  for (int x = 0; x < n; x++) {
    cin >> s[x];
    a[x] = s[x].length();
  }
  for (int x = 0; x < n; x++) {
    for (int y = 0; y < n - 1; y++) {
      if (a[y] > a[y + 1]) {
        int t = a[y];
        a[y] = a[y + 1];
        a[y + 1] = t;
        string temp = s[y];
        s[y] = s[y + 1];
        s[y + 1] = temp;
      }
    }
  }
  int f = 0;
  for (int x = 0; x < n; x++) {
    int i;
    for (int y = x + 1; y < n; y++) {
      i = s[y].find(s[x], 0);
      if (i == -1) {
        f = 1;
        break;
      }
    }
    if (f == 1) {
      break;
    }
  }
  if (f == 1) {
    cout << "NO";
  } else {
    cout << "YES" << endl;
    for (int x = 0; x < n; x++) {
      cout << s[x] << endl;
    }
  }
}

```