#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, j, n, num[101];
  bool fg = 0;
  char ch[101][101];
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%s", ch[i]);
    num[i] = strlen(ch[i]);
  }
  if (n == 1) {
    printf("YES\n");
    printf("%s", ch[0]);
  } else {
    for (i = 0; i < n; i++)
      for (j = n - 1; j > i; j--)
        if (num[j] < num[j - 1]) {
          swap(num[j], num[j - 1]);
          swap(ch[j], ch[j - 1]);
        }
    for (i = 0; i < n - 1; i++) {
      if (strstr(ch[i + 1], ch[i]) == NULL) fg = 1;
    }
    if (!fg) {
      printf("YES\n");
      for (i = 0; i < n; i++)
        if (i != n - 1)
          printf("%s\n", ch[i]);
        else
          printf("%s", ch[i]);
    } else
      printf("NO");
  }
  return 0;
}

### 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 main() {
  int i, j, n, num[101];
  bool fg = 0;
  char ch[101][101];
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%s", ch[i]);
    num[i] = strlen(ch[i]);
  }
  if (n == 1) {
    printf("YES\n");
    printf("%s", ch[0]);
  } else {
    for (i = 0; i < n; i++)
      for (j = n - 1; j > i; j--)
        if (num[j] < num[j - 1]) {
          swap(num[j], num[j - 1]);
          swap(ch[j], ch[j - 1]);
        }
    for (i = 0; i < n - 1; i++) {
      if (strstr(ch[i + 1], ch[i]) == NULL) fg = 1;
    }
    if (!fg) {
      printf("YES\n");
      for (i = 0; i < n; i++)
        if (i != n - 1)
          printf("%s\n", ch[i]);
        else
          printf("%s", ch[i]);
    } else
      printf("NO");
  }
  return 0;
}

```