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;
int n;
string s[105];
char x[105];
bool cmp(const string &a, const string &b) { return a.size() < b.size(); }
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%s", x);
    s[i] = string(x);
  }
  sort(s, s + n, cmp);
  for (int i = 1; i < n; i++)
    for (int j = 0; j + s[i - 1].size() <= s[i].size(); j++)
      if (!memcmp(s[i - 1].c_str(), s[i].c_str() + j, s[i - 1].size()))
        break;
      else if (j + s[i - 1].size() == s[i].size()) {
        printf("NO\n");
        return 0;
      }
  printf("YES\n");
  for (int i = 0; i < n; i++) printf("%s\n", s[i].c_str());
  return 0;
}
