The Preliminary Contest for ICPC Asia Xuzhou 2019 Who is better?

 https://nanti.jisuanke.com/t/41383

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------

const int maxn=1e3+9;
const int maxm=3e6+9;
const int mod=20090126;

//扩展欧几里得算法
void exgcd(ll a,ll b,ll &d,ll &x,ll &y)
{
    if(b==0){
        d=a;
        x=1,y=0;
    }
    else{
        exgcd(b,a%b,d,y,x);
        y-=(a/b)*x;
    }
}

//快速乘
#define ld long double
#define ull unsigned long long
inline ll ksc(ll x,ll y,ll p)
{
    ll z=(ld)x/p*y;
    ll res=(ull)x*y-(ull)z*p;
    return (res+p)%p;
}
//中国剩余定理
ll China(int n,ll *m,ll *a)
{
    ll M=m[0],d=0,y=0,x=0;
    ll ans=a[0];
    for(int i=1;i<n;i++)
    {
        ll aa=M;
        ll bb=m[i];
        ll cc=(a[i]-ans%bb+bb)%bb;//ax=c(mod b)

        ll g;
        exgcd(aa,bb,g,x,y);
        ll bnx=bb/g;
        if(cc%g!=0) return -1;
        cc/=g;
        x=ksc(x,cc,bnx);
        //x=(x*cc%bnx+bnx)%bnx;
        ans=ans+x*M;
        M*=bnx;
        ans=(ans%M+M)%M;
    }
    return (ans%M+M)%M;
}
ll m[maxn],a[maxn];
ll f[maxn];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    //int cnt=1;
    f[1]=f[2]=1;
    for(int i=3;i<80;i++)
    {
        f[i]=f[i-1]+f[i-2];
        //cnt++;
        //cout<<f[i]<<endl;
        //if(f[i]>(1e15)) break;
    }

    int k;
    cin>>k;
    for(int i=0;i<k;i++) cin>>m[i]>>a[i];

    ll n=China(k,m,a);
    if(n==-1) puts("Tankernb!");
    else
    {
        bool flag=0;
        for(int i=1;i<80;i++)
        {
            if(f[i]==n)
            {
                flag=1;
                break;
            }
        }
        if(flag) puts("Lbnb!");
        else puts("Zgxnb!");
    }

    return 0;
}