Substrings Sort

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 consecutiveletters 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

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".

题意都可以理解，那么就是查询上一个字符是否是当前字符的子串，如果是的话就继续检索，不是的话直接输出不行，检索到最后都没有输出不行的话，就打印所有字符串，按照字符串的长度。

做法，给输入的字符串按长度进行排序，然后你让字符串从最短开遍历最长的字符串，这里用到了一个STL的小知识点，就是find（），这个可以返回子串的位置。

#include<iostream>
#include<string>
int inf=4294967295;
using namespace std;
int main()
{
    int n;
    while(cin>>n)
    {
        string a[100];
        string w;
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                if(a[i].length()<a[j].length())
                {
                    w=a[i];
                    a[i]=a[j];
                    a[j]=w;
                }
            }
        }
        int flag=1;
        for(int i=0;i<n;i++)
        {
            for(int j=n-1;j>=i;j--)
            {
                int z=a[j].find(a[i]);
               /* cout<<z<<endl;
                if(z==inf)
                    flag=0;
                    */
            if(z>a[j].length())
                flag=0;
            }
        }
        if(flag==0)
            cout<<"NO"<<endl;
        else
        {
            cout<<"YES"<<endl;
            for(int i=0;i<n;i++)
                cout<<a[i]<<endl;
        }
    }
    return 0;
}