#include <bits/stdc++.h>
using namespace std;
bool cmp(string a, string b) { return a.length() < b.length(); }
int main() {
  int n;
  while (~scanf("%d", &n)) {
    vector<string> t;
    vector<string> tt;
    string s;
    int vis[110] = {0};
    for (int i = 0; i < n; i++) {
      cin >> s;
      t.push_back(s);
      if (vis[s.length()] == 0) {
        vis[s.length()] = 1;
        tt.push_back(s);
      }
    }
    sort(t.begin(), t.end(), cmp);
    int flag = 0;
    for (int i = 0; i < t.size() - 1; i++) {
      if (t[i].length() == t[i + 1].length())
        if (t[i] != t[i + 1]) {
          flag = 1;
          break;
        }
    }
    if (flag == 1)
      printf("NO\n");
    else {
      int flag = 0;
      sort(tt.begin(), tt.end(), cmp);
      for (int i = 0; i < tt.size() - 1; i++) {
        if (tt[i + 1].find(tt[i]) == -1) {
          flag = 1;
          break;
        }
      }
      if (flag == 0) {
        printf("YES\n");
        for (int i = 0; i < t.size(); i++) {
          cout << t[i] << endl;
        }
      } else
        printf("NO\n");
    }
  }
}

### Prompt

Please provide a CPP coded solution to the problem described below:

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 cmp(string a, string b) { return a.length() < b.length(); }
int main() {
  int n;
  while (~scanf("%d", &n)) {
    vector<string> t;
    vector<string> tt;
    string s;
    int vis[110] = {0};
    for (int i = 0; i < n; i++) {
      cin >> s;
      t.push_back(s);
      if (vis[s.length()] == 0) {
        vis[s.length()] = 1;
        tt.push_back(s);
      }
    }
    sort(t.begin(), t.end(), cmp);
    int flag = 0;
    for (int i = 0; i < t.size() - 1; i++) {
      if (t[i].length() == t[i + 1].length())
        if (t[i] != t[i + 1]) {
          flag = 1;
          break;
        }
    }
    if (flag == 1)
      printf("NO\n");
    else {
      int flag = 0;
      sort(tt.begin(), tt.end(), cmp);
      for (int i = 0; i < tt.size() - 1; i++) {
        if (tt[i + 1].find(tt[i]) == -1) {
          flag = 1;
          break;
        }
      }
      if (flag == 0) {
        printf("YES\n");
        for (int i = 0; i < t.size(); i++) {
          cout << t[i] << endl;
        }
      } else
        printf("NO\n");
    }
  }
}

```