#include <bits/stdc++.h>
using namespace std;
struct str {
  char s[102];
  int len;
} ss[102];
bool cmp(struct str a, struct str b) { return a.len < b.len; }
int main() {
  int i, j;
  int n;
  while (cin >> n) {
    for (i = 0; i < n; i++) {
      scanf("%s", ss[i].s);
      ss[i].len = strlen(ss[i].s);
    }
    sort(ss, ss + n, cmp);
    int flag = 0;
    struct str tmp;
    for (i = 0; i < n; i++) {
      for (j = i + 1; j < n; j++) {
        if (ss[i].len == ss[j].len) {
          if (strcmp(ss[i].s, ss[j].s) != 0) {
            flag = 1;
          }
        }
      }
    }
    if (flag == 1) {
      puts("NO");
      continue;
    } else {
      for (i = 0; i < n; i++) {
        for (j = i + 1; j < n; j++) {
          if (strstr(ss[j].s, ss[i].s) == NULL) {
            flag = 1;
            break;
          } else
            break;
        }
        if (flag == 1) break;
      }
    }
    if (flag == 1)
      puts("NO");
    else {
      puts("YES");
      for (i = 0; i < n; i++) {
        puts(ss[i].s);
      }
    }
  }
}

### Prompt

Please formulate 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;
struct str {
  char s[102];
  int len;
} ss[102];
bool cmp(struct str a, struct str b) { return a.len < b.len; }
int main() {
  int i, j;
  int n;
  while (cin >> n) {
    for (i = 0; i < n; i++) {
      scanf("%s", ss[i].s);
      ss[i].len = strlen(ss[i].s);
    }
    sort(ss, ss + n, cmp);
    int flag = 0;
    struct str tmp;
    for (i = 0; i < n; i++) {
      for (j = i + 1; j < n; j++) {
        if (ss[i].len == ss[j].len) {
          if (strcmp(ss[i].s, ss[j].s) != 0) {
            flag = 1;
          }
        }
      }
    }
    if (flag == 1) {
      puts("NO");
      continue;
    } else {
      for (i = 0; i < n; i++) {
        for (j = i + 1; j < n; j++) {
          if (strstr(ss[j].s, ss[i].s) == NULL) {
            flag = 1;
            break;
          } else
            break;
        }
        if (flag == 1) break;
      }
    }
    if (flag == 1)
      puts("NO");
    else {
      puts("YES");
      for (i = 0; i < n; i++) {
        puts(ss[i].s);
      }
    }
  }
}

```