1077 Kuchiguse (20 分)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e3+10;
const int maxm=4e4+100;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,idx[maxn];
string s[maxn];
int judge(){
    rep(i,0,n) if(idx[i]<0) return 0;
    return 1;
}
int judge2(){
    char pre=s[0][idx[0]];
    rep(i,1,n) if(pre!=s[i][idx[i]]){
        return 0;
    }
    return 1;
}
int main(){
    cin>>n;getchar();
    rep(i,0,n){
        getline(cin,s[i]);
        idx[i]=s[i].size()-1;
    }
    while(judge()){
        if(judge2()){
            rep(i,0,n) idx[i]--;
        }else{
            break;
        }
    }
    idx[0]++;
    if(idx[0]==s[0].size()) cout<<"nai\n";
    else{
        rep(i,idx[0],s[0].size()) cout<<s[0][i];
        cout<<"\n";
    }
    return 0;
}