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".
#include <bits/stdc++.h>
using namespace std;
const int INF = ~(1 << 31);
const double E = exp(1.0);
const double Pi = 4 * atan(1.0);
const int N = 100 + 5;
string a[N];
bool cmp(string &a1, string &a2) { return a1.length() < a2.length(); }
int main() {
  int n;
  cin >> n;
  int i, j;
  for (i = 0; i <= n - 1; ++i) {
    cin >> a[i];
  }
  sort(a, a + n, cmp);
  for (i = 0; i <= n - 2; ++i) {
    int pos = a[i + 1].find(a[i], 0);
    if (pos == -1) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (i = 0; i <= n - 1; ++i) cout << a[i] << endl;
  return 0;
}
