#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFLL = 1e18;
const int MOD = 1000000007;
const int alphabet = 26;
const int MAXINT = 2e6 + 1;
bool subStr(string s1, string s2) {
  int n1 = s1.size(), n2 = s2.size();
  bool ans = false;
  for (int k = 0; k < n2 && !ans; k++) {
    int j = 0, i = k;
    while (i < n2 && j < n1 && s2[i] == s1[j]) i++, j++;
    ans = bool(j == n1);
  }
  return ans;
}
bool tamano(string s1, string s2) {
  if (s1.size() == s2.size())
    return s1 < s2;
  else
    return s1.size() < s2.size();
}
int main() {
  int n;
  string s;
  vector<string> strs;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) cin >> s, strs.push_back(s);
  sort(strs.begin(), strs.end(), tamano);
  vector<string> ans;
  for (int i = 0; i < n; i++) {
    string sub = strs[i];
    bool valid = true;
    for (int j = i + 1; j < n && valid; j++) valid = subStr(sub, strs[j]);
    if (valid)
      ans.push_back(sub);
    else
      break;
  }
  if (ans.size() != n)
    printf("NO\n");
  else {
    printf("YES\n");
    for (string s1 : ans) cout << s1 << endl;
  }
}

### 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>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFLL = 1e18;
const int MOD = 1000000007;
const int alphabet = 26;
const int MAXINT = 2e6 + 1;
bool subStr(string s1, string s2) {
  int n1 = s1.size(), n2 = s2.size();
  bool ans = false;
  for (int k = 0; k < n2 && !ans; k++) {
    int j = 0, i = k;
    while (i < n2 && j < n1 && s2[i] == s1[j]) i++, j++;
    ans = bool(j == n1);
  }
  return ans;
}
bool tamano(string s1, string s2) {
  if (s1.size() == s2.size())
    return s1 < s2;
  else
    return s1.size() < s2.size();
}
int main() {
  int n;
  string s;
  vector<string> strs;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) cin >> s, strs.push_back(s);
  sort(strs.begin(), strs.end(), tamano);
  vector<string> ans;
  for (int i = 0; i < n; i++) {
    string sub = strs[i];
    bool valid = true;
    for (int j = i + 1; j < n && valid; j++) valid = subStr(sub, strs[j]);
    if (valid)
      ans.push_back(sub);
    else
      break;
  }
  if (ans.size() != n)
    printf("NO\n");
  else {
    printf("YES\n");
    for (string s1 : ans) cout << s1 << endl;
  }
}

```