【EXCRT模板】

防止爆long long 使用了慢速乘，结果T了。
然后换成普通乘就过了…
这数据也太假了，n<=1e15，很有可能爆long long 的啊…
反正是EXCRT的板子题…

#include <bits/stdc++.h>
#define sc(n) scanf("%d",&n)
#define pt(n) printf("%d\n",n)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int maxn = 73;
ll fib[maxn],r[maxn],m[maxn];
unordered_map<ll,int> mp;
ll mul(ll a,ll b,ll p)
{
	ll ans = 0;
	while(b)
	{
		if(b&1) ans = (ans+a)%p;
		b>>=1;
		a = (a+a)%p;
	}
	return ans;
}
ll exgcd(ll a,ll b,ll &x,ll &y)
{
	if(!b)
	{
		x = 1,y = 0;
		return a;
	}
	ll d = exgcd(b,a%b,y,x);
	y -= (a/b)*x;
	return d;
}
ll excrt(ll n,ll *r,ll *m)
{
	ll res = r[0],mod = m[0];
	for(int i=1;i<n;i++)
	{
		ll a = mod,b = m[i],x,y;
		ll c = (r[i]-res%b+b)%b;
		ll d = exgcd(a,b,x,y),bg = b/d;
		if(c%d!=0) return -1;
		x = (x*(c/d)%bg)%bg;
		//x = mul(x,c/d,bg);
		res += x*mod;
		mod *= bg;
		res = (res%mod+mod)%mod;
	}
	return res;
}
int main()
{
	fib[0] = fib[1] = 1;
	mp[1] = 1;
	for(int i=2;i<maxn;i++) fib[i] = fib[i-1]+fib[i-2],mp[fib[i]] = 1;
	int k;
	scanf("%d",&k);
	for(int i=0;i<k;i++)
	{
		scanf("%lld%lld",m+i,r+i);
	}
	ll x = excrt(k,r,m);
	if(x==-1) puts("Tankernb!");
	else if(mp[x]) puts("Lbnb!");
	else puts("Zgxnb!");
	return 0;
}