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

AC代码：

/*
该题用到string类。
思路：先将录入的字符串按长度从小到大排序，然后从第二个字符串开始依次向前判断是否包含前面的字符串，若存在不包含前面的字符串的字符串，则直接输出NO，否则输出YES。
排序这里因数据量较小，且排序元素为字符串，所有我用了一个简单冒泡排序+表排序。
*/
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>

#define mod 1000000007
const int INF = 0x3f3f3f3f;
typedef long long ll;
const int maxn = 15;
using namespace std;

struct node
{
    string str;
    int len;
};
int n;
node v[105];
int sor[105];

int main()
{
    scanf("%d", &n);
    getchar();
    for(int i = 0; i < n; i++)
    {
        sor[i] = i;
    }
    for(int i = 0; i < n; i++)
    {
        cin>>v[i].str;
        v[i].len = v[i].str.length();
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n-i-1; j++)
        {
            if(v[sor[j]].len > v[sor[j+1]].len)
            {
                int temp = sor[j];
                sor[j] = sor[j+1];
                sor[j+1] = temp;
            }
        }
    }
    bool flag = true;
    for(int i = 1; i < n; i++)
    {
        if(string::npos == v[sor[i]].str.find(v[sor[i-1]].str))
        {
            flag = false;
            break;
        }
    }
    if(flag)
    {
        printf("YES\n");
        for(int i = 0; i < n; i++)
        {
            cout<<v[sor[i]].str<<endl;
        }
    }
    else
    {
        printf("NO\n");
    }
    return 0;
}