#include<bits/stdc++.h>
#define F first 
#define S second 
using namespace std;
int const N=1<<19, poc=1<<18;
pair<int,int>tree[N];
 
void update(int v){
	swap(tree[v].F,tree[v].S);
	v/=2;
	while(v>0){
		tree[v].F=tree[2*v+1].F;
		tree[v].S=tree[2*v].S;
		if(tree[2*v].F>=tree[2*v+1].S) tree[v].F+=tree[2*v].F-tree[2*v+1].S;
		else tree[v].S+=tree[2*v+1].S-tree[2*v].F;
		v/=2;
	}
}
 
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,a;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a;
		if(a==-1) tree[i+poc].F++;
		else tree[i+poc].S++;
	}
	for(int i=1;i<=n;i++){
		update(i+poc);
	}
	while(true){
		cin>>a;
		if(a==-1) return 0;
		if(a==0){
			if(tree[1].F==0&tree[1].S==0) cout<<"TAK\n";
			else cout<<"NIE\n";
		}
		else update(a+poc);
	}
 
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBGIGZpcnN0IAojZGVmaW5lIFMgc2Vjb25kIAp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgY29uc3QgTj0xPDwxOSwgcG9jPTE8PDE4OwpwYWlyPGludCxpbnQ+dHJlZVtOXTsKCnZvaWQgdXBkYXRlKGludCB2KXsKCXN3YXAodHJlZVt2XS5GLHRyZWVbdl0uUyk7Cgl2Lz0yOwoJd2hpbGUodj4wKXsKCQl0cmVlW3ZdLkY9dHJlZVsyKnYrMV0uRjsKCQl0cmVlW3ZdLlM9dHJlZVsyKnZdLlM7CgkJaWYodHJlZVsyKnZdLkY+PXRyZWVbMip2KzFdLlMpIHRyZWVbdl0uRis9dHJlZVsyKnZdLkYtdHJlZVsyKnYrMV0uUzsKCQllbHNlIHRyZWVbdl0uUys9dHJlZVsyKnYrMV0uUy10cmVlWzIqdl0uRjsKCQl2Lz0yOwoJfQp9CgppbnQgbWFpbigpewoJaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbygwKTsKCWNpbi50aWUoMCk7Cgljb3V0LnRpZSgwKTsKCWludCBuLGE7CgljaW4+Pm47Cglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJY2luPj5hOwoJCWlmKGE9PS0xKSB0cmVlW2krcG9jXS5GKys7CgkJZWxzZSB0cmVlW2krcG9jXS5TKys7Cgl9Cglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJdXBkYXRlKGkrcG9jKTsKCX0KCXdoaWxlKHRydWUpewoJCWNpbj4+YTsKCQlpZihhPT0tMSkgcmV0dXJuIDA7CgkJaWYoYT09MCl7CgkJCWlmKHRyZWVbMV0uRj09MCZ0cmVlWzFdLlM9PTApIGNvdXQ8PCJUQUtcbiI7CgkJCWVsc2UgY291dDw8Ik5JRVxuIjsKCQl9CgkJZWxzZSB1cGRhdGUoYStwb2MpOwoJfQoJCn0=

OAoxIDEgLTEgMSAxIC0xIC0xIC0xCjAKMgowCjcKMAozCjAKNQowCi0x

8
1 1 -1 1 1 -1 -1 -1
0
2
0
7
0
3
0
5
0
-1