Codeforces 777D：Cloud of Hashtags（暴力，水題）

Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive programming. For each news he also creates a list of hashtags to make searching for a particular topic more comfortable. For the purpose of this problem we define hashtag as a string consisting of lowercase English letters and exactly one symbol '#' located at the beginning of the string. The length of the hashtag is defined as the number of symbols in it without the symbol '#'.

The head administrator of the page told Vasya that hashtags should go in lexicographical order (take a look at the notes section for the definition).

Vasya is lazy so he doesn't want to actually change the order of hashtags in already published news. Instead, he decided to delete some suffixes (consecutive characters at the end of the string) of some of the hashtags. He is allowed to delete any number of characters, even the whole string except for the symbol '#'. Vasya wants to pick such a way to delete suffixes that the total number of deleted symbols is minimum possible. If there are several optimal solutions, he is fine with any of them.

Input

The first line of the input contains a single integer \(n (1 ≤ n ≤ 500 000)\) — the number of hashtags being edited now.

Each of the next \(n\) lines contains exactly one hashtag of positive length.

It is guaranteed that the total length of all hashtags (i.e. the total length of the string except for characters '#') won't exceed \(500 000\).

Output

Print the resulting hashtags in any of the optimal solutions.

Examples

Input

3
#book
#bigtown
#big

Output

#b
#big
#big

Input

3
#book
#cool
#cold

Output

#book
#co
#cold

Input

4
#car
#cart
#art
#at

Output

#
#
#art
#at

Input

3
#apple
#apple
#fruit

Output

#apple
#apple
#fruit

Note

Word \(a_1, a_2, ..., a_m\) of length \(m\) is lexicographically not greater than word \(b_1, b_2, ..., b_k\) of length \(k\), if one of two conditions hold:

• at first position \(i\), such that \(a_i ≠ b_i\), the character \(a_i\) goes earlier in the alphabet than character \(b_i\), i.e. \(a\) has smaller character than \(b\) in the first position where they differ;
• if there is no such position \(i\) and \(m ≤ k\), i.e. the first word is a prefix of the second or two words are equal.

The sequence of words is said to be sorted in lexicographical order if each word (except the last one) is lexicographically not greater than the next word.

For the words consisting of lowercase English letters the lexicographical order coincides with the alphabet word order in the dictionary.

According to the above definition, if a hashtag consisting of one character '#' it is lexicographically not greater than any other valid hashtag. That's why in the third sample we can't keep first two hashtags unchanged and shorten the other two.

題意

\(n\)個字符串，要求不改變位置，刪除最少的字符串的後綴，使這些字符串按照字典序非遞減的順序排列

思路

暴力。

從後往前比較相鄰的兩個字符串的字典序，若是第\(i-1\)個字符串字典序小於第\(i\)個，那麼就不須要刪。不然，找到第\(i-1\)個字符串到哪一個位置爲止，能夠知足字典序不大於第\(i\)個的字典序，而後截取出來這段字符串便可

代碼

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ms(a,b) memset(a,b,sizeof(a))
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3f;
const int maxn=1e6+10;
const int mod=1e9+7;
const int maxm=1e3+10;
using namespace std;
vector<string>ve;
vector<string>ans;
int get_place(string s1,string s2)
{
    int l1=s1.length();
    int l2=s2.length();
    int i;
    for(i=0;i<min(l2,l1);i++)
    {
        if(s1[i]<s2[i])
            return l1;
        if(s1[i]==s2[i])
            continue;
        if(s1[i]>s2[i])
            return i;
    }
    if(i==l2)
    {
        if(l1>l2)
        {
            if(s1[i-1]==s2[i-1])
                return l2;
            else
                return l1;
        }
    }
    return l1;
}
int main(int argc, char const *argv[])
{
    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        srand((unsigned int)time(NULL));
    #endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin>>n;
    string s;
    for(int i=0;i<n;i++)
    {
        cin>>s;
        ve.push_back(s);
    }
    string s1,s2;
    ans.push_back(ve[n-1]);
    for(int i=n-2;i>=0;i--)
    {
        s1=ve[i];
        s2=ans[n-(i+2)];
        int pos=get_place(s1,s2);
        string ss;
        ss=s1.substr(0,pos);
        ans.push_back(ss);
    }
    for(int i=n-1;i>0;i--)
        cout<<ans[i]<<endl;
    cout<<ve[n-1]<<endl;
    #ifndef ONLINE_JUDGE
        cerr<<"Time elapsed: "<<1.0*clock()/CLOCKS_PER_SEC<<" s."<<endl;
    #endif
    return 0;
}