#include <bits/stdc++.h>
using namespace std;
const int MAX = 100005;
const int inf = 1e7 + 5;
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long isSubstring(string s2, string s1) {
  long long M = s1.length();
  long long N = s2.length();
  for (long long i = 0; i <= N - M; i++) {
    long long j;
    for (j = 0; j < M; j++)
      if (s2[i + j] != s1[j]) break;
    if (j == M) return i;
  }
  return -1;
}
void solve() {
  long long n;
  cin >> n;
  vector<pair<long long, string>> ans(n);
  string s;
  for (long long i = 0; i < n; i++) cin >> s, ans[i] = make_pair(s.size(), s);
  sort(ans.begin(), ans.end());
  for (long long i = 0; i < n; i++) {
    long long f = 0;
    for (long long j = 0; j < i; j++) {
      string s1 = ans[i].second;
      string s2 = ans[j].second;
      if (isSubstring(s1, s2) == -1) {
        cout << "NO" << '\n';
        return;
      }
    }
  }
  cout << "YES" << '\n';
  for (long long i = 0; i < n; i++) cout << ans[i].second << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long T = 1;
  while (T--) {
    solve();
  }
}

### Prompt

Your challenge is to write 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;
const int MAX = 100005;
const int inf = 1e7 + 5;
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long isSubstring(string s2, string s1) {
  long long M = s1.length();
  long long N = s2.length();
  for (long long i = 0; i <= N - M; i++) {
    long long j;
    for (j = 0; j < M; j++)
      if (s2[i + j] != s1[j]) break;
    if (j == M) return i;
  }
  return -1;
}
void solve() {
  long long n;
  cin >> n;
  vector<pair<long long, string>> ans(n);
  string s;
  for (long long i = 0; i < n; i++) cin >> s, ans[i] = make_pair(s.size(), s);
  sort(ans.begin(), ans.end());
  for (long long i = 0; i < n; i++) {
    long long f = 0;
    for (long long j = 0; j < i; j++) {
      string s1 = ans[i].second;
      string s2 = ans[j].second;
      if (isSubstring(s1, s2) == -1) {
        cout << "NO" << '\n';
        return;
      }
    }
  }
  cout << "YES" << '\n';
  for (long long i = 0; i < n; i++) cout << ans[i].second << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long T = 1;
  while (T--) {
    solve();
  }
}

```