#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
bool cmpManh(const std::pair<long long, long long>& l,
             const std::pair<long long, long long>& r) {
  return ((llabs(l.first) + llabs(l.second)) <
          (llabs(r.first) + llabs(r.second)));
}
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
bool compare(string& s1, string& s2) { return s1.size() < s2.size(); }
int main(void) {
  int n;
  scanf("%d", &n);
  std::vector<string> v;
  for (int i = 0; i < n; ++i) {
    string ss;
    cin >> ss;
    v.push_back(ss);
  }
  sort(v.begin(), v.end(), compare);
  auto it = v.begin();
  it++;
  int poss = 1;
  for (auto x : v) {
    if (it == v.end()) break;
    string a = *it;
    if (a.find(x) == std::string::npos) {
      poss = 0;
      break;
    }
    it++;
  }
  if (poss) {
    cout << "YES\n";
    for (auto x : v) {
      cout << x << '\n';
    }
  } else {
    cout << "NO\n";
  }
  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>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
bool cmpManh(const std::pair<long long, long long>& l,
             const std::pair<long long, long long>& r) {
  return ((llabs(l.first) + llabs(l.second)) <
          (llabs(r.first) + llabs(r.second)));
}
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
bool compare(string& s1, string& s2) { return s1.size() < s2.size(); }
int main(void) {
  int n;
  scanf("%d", &n);
  std::vector<string> v;
  for (int i = 0; i < n; ++i) {
    string ss;
    cin >> ss;
    v.push_back(ss);
  }
  sort(v.begin(), v.end(), compare);
  auto it = v.begin();
  it++;
  int poss = 1;
  for (auto x : v) {
    if (it == v.end()) break;
    string a = *it;
    if (a.find(x) == std::string::npos) {
      poss = 0;
      break;
    }
    it++;
  }
  if (poss) {
    cout << "YES\n";
    for (auto x : v) {
      cout << x << '\n';
    }
  } else {
    cout << "NO\n";
  }
  return (0);
}

```