#include <bits/stdc++.h>
int main() {
  char str[200][200], temp[200];
  int n, i, j, len, main_count = 0, count = 0, i1, j1;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%s", str[i]);
  }
  for (i = 0; i < n - 1; i++) {
    for (j = i + 1; j < n; j++) {
      if (strlen(str[i]) > strlen(str[j])) {
        strcpy(temp, str[i]);
        strcpy(str[i], str[j]);
        strcpy(str[j], temp);
      }
    }
  }
  for (i = 0; i < n - 1; i++) {
    for (j = i + 1; j < n; j++) {
      if (strstr(str[j], str[i])) {
        main_count++;
        j = n;
      } else {
        printf("NO");
        return 0;
      }
    }
  }
  if (main_count == n - 1) {
    printf("YES\n");
    for (i = 0; i < n; i++) {
      printf("%s\n", str[i]);
    }
  } else {
    printf("NO");
  }
  return 0;
}

### 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() {
  char str[200][200], temp[200];
  int n, i, j, len, main_count = 0, count = 0, i1, j1;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%s", str[i]);
  }
  for (i = 0; i < n - 1; i++) {
    for (j = i + 1; j < n; j++) {
      if (strlen(str[i]) > strlen(str[j])) {
        strcpy(temp, str[i]);
        strcpy(str[i], str[j]);
        strcpy(str[j], temp);
      }
    }
  }
  for (i = 0; i < n - 1; i++) {
    for (j = i + 1; j < n; j++) {
      if (strstr(str[j], str[i])) {
        main_count++;
        j = n;
      } else {
        printf("NO");
        return 0;
      }
    }
  }
  if (main_count == n - 1) {
    printf("YES\n");
    for (i = 0; i < n; i++) {
      printf("%s\n", str[i]);
    }
  } else {
    printf("NO");
  }
  return 0;
}

```