Substrings Sort string 基本操作

You are given nn 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 aa is a substring of string bb if it is possible to choose several consecutive letters in bb in such a way that they form aa. 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 nn (1≤n≤1001≤n≤100) — the number of strings.

The next nn lines contain the given strings. The number of letters in each string is from 11 to 100100, inclusive. Each string consists of lowercase English letters.

Some strings might be equal.

Output

If it is impossible to reorder nn given strings in required order, print "NO" (without quotes).

Otherwise print "YES" (without quotes) and nn given strings in required order.

Examples

input

Copy

5
a
aba
abacaba
ba
aba

output

Copy

YES
a
ba
aba
aba
abacaba

input

Copy

5
a
abacaba
ba
aba
abab

output

Copy

NO

input

Copy

3
qwerty
qwerty
qwerty

output

Copy

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 maxn = 1e5 + ;
 typedef long long LL;
 int n;
 string a[];
 int cmp(string a, string b) {
     return a.size() < b.size();
 }
 int main() {
     scanf("%d", &n);
     for (int i =  ; i < n ; i++) cin >> a[i];
     sort(a, a + n, cmp);
     int num=;
     for (int i =  ; i < n ; i++) {
         if (a[i].find(a[i-]) != string::npos) num++;
     }
     if (num!=n-) printf("NO\n");
     else {
         printf("YES\n");
         for (int i =  ; i < n ; i++ )
             cout << a[i] << endl;
     }
     return ;
 }