#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize(2)
//#pragma GCC optimize(3, "Ofast", "inline")
#define hh putchar('\n')
#define kg putchar(' ')
#define debug puts("debug")
#define int long long
//#define int __int128
namespace quickread{
	template<typename T> void read(T &x){
		x=0;char c=getchar();T neg=0;
		while(!isdigit(c)) neg|=!(c^'-'),c=getchar();
		while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
		if(neg) x=(~x)+1;
	}
	template<typename T> void write(T x){
		if(x<0) putchar('-'),x=~x+1;
		if(x>9) write(x/10);
		putchar(x%10^48);
	}
	inline string readstr(){
    	char ch=getchar();string str="";
		while(!isalnum(ch)) ch=getchar();
		while(isalnum(ch)){str+=ch;ch=getchar();}
		return str;
	}
	inline char readchar(){
		char ch=getchar();
		while(!isalnum(ch)) ch=getchar();
		return ch;
	}
}
using namespace quickread;
const int N=2e6+10,inf=2147483647;
int n,m,p[N],d[N],sum[N],q[N],l,r;
bool tag[N]; 
signed main(){
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	read(n),m=n*2;
	for(int i=1;i<=n;++i) read(p[i]),read(d[i]);
	for(int i=1;i<=n;++i) sum[i]=sum[i+1]=p[i]-d[i];
	for(int i=1;i<=m;++i) sum[i]+=sum[i-1];
	l=1,r=0;
	for(int i=m;i;--i){
		while(l<=r&&q[l]>=i+n) ++l;
		while(l<=r&&sum[q[r]]>=sum[i]) --r;
		q[++r]=i;
		if(i<=n) tag[i]|= (bool)(sum[q[l]]-sum[i-1]>=0);
	}
	d[0]=d[n];
	for(int i=1;i<=n;++i) sum[i]=sum[i+n]=p[i]-d[i-1];
	for(int i=1;i<=m;++i) sum[i]+=sum[i-1];
	memset(q,0,sizeof(q));
	l=1,r=0;
	for(int i=1;i<=m;++i){
		while(l<=r&&q[l]<i-n) ++l;
		while(l<=r&&sum[q[r]]<=sum[i]) --r;
		q[++r]=i;
		if(i>n) tag[i-n]|= (bool)(sum[i]-sum[q[l]]>=0);
	}
	for(int i=1;i<=n;++i){
		if(tag[i]) puts("TAK");
		else puts("NIE");
	}
	return 0;
}

记录