#include <bits/stdc++.h>
using namespace std;
int n;
string a[200];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++)
    for (int j = i + 1; j <= n; j++) {
      if (a[i].length() > a[j].length()) swap(a[i], a[j]);
    }
  int ok = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j < i; j++) {
      if (a[i] == a[j]) continue;
      if (a[i].length() <= a[j].length()) {
        ok = 1;
        break;
      }
      int pd = 0;
      for (int pp = 0; pp <= a[i].length() - a[j].length(); pp++) {
        int err = 0;
        for (int k = 0; k < a[j].length(); k++)
          if (a[i][k + pp] != a[j][k]) {
            err = 1;
            break;
          }
        if (!err) {
          pd = 1;
          break;
        }
      }
      if (!pd) {
        ok = 1;
        break;
      }
    }
    if (ok == 1) break;
  }
  if (ok == 1) {
    printf("NO\n");
    return 0;
  }
  printf("YES\n");
  for (int i = 1; i <= n; i++) cout << a[i] << endl;
}

### Prompt

Please create a solution in CPP 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 n;
string a[200];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++)
    for (int j = i + 1; j <= n; j++) {
      if (a[i].length() > a[j].length()) swap(a[i], a[j]);
    }
  int ok = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j < i; j++) {
      if (a[i] == a[j]) continue;
      if (a[i].length() <= a[j].length()) {
        ok = 1;
        break;
      }
      int pd = 0;
      for (int pp = 0; pp <= a[i].length() - a[j].length(); pp++) {
        int err = 0;
        for (int k = 0; k < a[j].length(); k++)
          if (a[i][k + pp] != a[j][k]) {
            err = 1;
            break;
          }
        if (!err) {
          pd = 1;
          break;
        }
      }
      if (!pd) {
        ok = 1;
        break;
      }
    }
    if (ok == 1) break;
  }
  if (ok == 1) {
    printf("NO\n");
    return 0;
  }
  printf("YES\n");
  for (int i = 1; i <= n; i++) cout << a[i] << endl;
}

```