#include <bits/stdc++.h>
using namespace std;
bool issub(string a, string b) {
  int la = a.length();
  int lb = b.length();
  if (la > lb) return false;
  int flag = 0;
  for (int i = 0; i < lb; i++) {
    int t = i;
    int j = 0;
    while (t < lb && j < la && b[t] == a[j]) {
      t++;
      j++;
    }
    if (j == la) return true;
  }
  return false;
}
string str[200];
void echo(int n) {
  for (int i = 0; i < n; i++) {
    cout << str[i] << endl;
  }
  cout << "----------------------" << endl;
}
int main() {
  int n;
  cin >> n;
  string tmp;
  for (int i = 0; i < n; i++) {
    cin >> tmp;
    int j = i - 1;
    while (j >= 0 && issub(tmp, str[j])) {
      str[j + 1] = str[j];
      j--;
    }
    str[j + 1] = tmp;
  }
  int flag = 0;
  for (int i = 1; i < n; i++) {
    if (issub(str[i - 1], str[i]))
      continue;
    else {
      flag = 1;
      break;
    }
  }
  if (flag) {
    cout << "NO" << endl;
  } else {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) {
      cout << str[i] << endl;
    }
  }
  return 0;
}

### Prompt

Your task is to create 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;
bool issub(string a, string b) {
  int la = a.length();
  int lb = b.length();
  if (la > lb) return false;
  int flag = 0;
  for (int i = 0; i < lb; i++) {
    int t = i;
    int j = 0;
    while (t < lb && j < la && b[t] == a[j]) {
      t++;
      j++;
    }
    if (j == la) return true;
  }
  return false;
}
string str[200];
void echo(int n) {
  for (int i = 0; i < n; i++) {
    cout << str[i] << endl;
  }
  cout << "----------------------" << endl;
}
int main() {
  int n;
  cin >> n;
  string tmp;
  for (int i = 0; i < n; i++) {
    cin >> tmp;
    int j = i - 1;
    while (j >= 0 && issub(tmp, str[j])) {
      str[j + 1] = str[j];
      j--;
    }
    str[j + 1] = tmp;
  }
  int flag = 0;
  for (int i = 1; i < n; i++) {
    if (issub(str[i - 1], str[i]))
      continue;
    else {
      flag = 1;
      break;
    }
  }
  if (flag) {
    cout << "NO" << endl;
  } else {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) {
      cout << str[i] << endl;
    }
  }
  return 0;
}

```