#include <bits/stdc++.h>
int main() {
  int n, rate[1000] = {0}, i, j, k, flag, temp;
  char a[1000][1000], t[1000];
  scanf("%d", &n);
  getchar();
  for (i = 0; i < n; i++) {
    gets(a[i]);
    flag = 1;
    for (j = 0; j < i && flag == 1; j++) {
      if (strlen(a[i]) < strlen(a[rate[j]])) {
        flag = 0;
        for (k = i; k >= j; k--) rate[k + 1] = rate[k];
        rate[j] = i;
      }
    }
    if (flag == 1) rate[i] = i;
  }
  flag = 1;
  for (i = 0; i < n - 1 && flag == 1; i++) {
    flag = 0;
    for (j = 0; j <= (strlen(a[rate[i + 1]]) - strlen(a[rate[i]])) && flag == 0;
         j++) {
      for (k = 0; k < strlen(a[rate[i]]); k++) {
        t[k] = a[rate[i + 1]][j + k];
      }
      if (strcmp(t, a[rate[i]]) == 0) flag = 1;
    }
  }
  if (flag == 1) {
    printf("YES\n");
    for (i = 0; i < n; i++) printf("%s\n", a[rate[i]]);
  } else
    printf("NO\n");
}

### 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>
int main() {
  int n, rate[1000] = {0}, i, j, k, flag, temp;
  char a[1000][1000], t[1000];
  scanf("%d", &n);
  getchar();
  for (i = 0; i < n; i++) {
    gets(a[i]);
    flag = 1;
    for (j = 0; j < i && flag == 1; j++) {
      if (strlen(a[i]) < strlen(a[rate[j]])) {
        flag = 0;
        for (k = i; k >= j; k--) rate[k + 1] = rate[k];
        rate[j] = i;
      }
    }
    if (flag == 1) rate[i] = i;
  }
  flag = 1;
  for (i = 0; i < n - 1 && flag == 1; i++) {
    flag = 0;
    for (j = 0; j <= (strlen(a[rate[i + 1]]) - strlen(a[rate[i]])) && flag == 0;
         j++) {
      for (k = 0; k < strlen(a[rate[i]]); k++) {
        t[k] = a[rate[i + 1]][j + k];
      }
      if (strcmp(t, a[rate[i]]) == 0) flag = 1;
    }
  }
  if (flag == 1) {
    printf("YES\n");
    for (i = 0; i < n; i++) printf("%s\n", a[rate[i]]);
  } else
    printf("NO\n");
}

```