Codeforces Round #486 (Div. 3) B. Substrings Sort

B. Substrings Sort

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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\le n\le 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

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

题意：判断一系列字符串能不能使第i个字符串在第i+1个字符串中找到，能则按顺序输出

题解：按字符串长度排一下序，然后再用find遍历一遍就好了

代码：#include <bits/stdc++.h>

using namespace std;
string s[110];
int nums[110];
string str="";
int n;
int cmp(string a,string b)
{
	return a.length()<b.length();
}
int main()
{
	cin>>n;
	int q=0;
	for(int i=0;i<n;i++)
	{
		cin>>s[i];
	}
	sort(s,s+n,cmp);
	int p=1;
	for(int i=1;i<n;i++)
	{
		if(s[i].find(s[i-1])==-1)
		{
			p=0;
			break;
		}
	}
	if(p)
	{
		cout<<"YES"<<endl;
		for(int i=0;i<n;i++)
		{	
			cout<<s[i]<<endl;
		}
	}
	else
	{
		cout<<"NO"<<endl;
	}
	
}