#include <bits/stdc++.h>
using namespace std;
int INF = 2000000000,A[5005],dist[50005];
set < pair<int,int> > dijk;
int main()
{
	// freopen("input.txt", "r", stdin);
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; ++i)
	{
		scanf("%d", &A[i]);
	}
	for (int i = 0; i < A[0]; ++i)
	{
		dist[i] = INF;
	}
	dist[0] = 0;
	dijk.insert(make_pair(dist[0],0));
	while(!dijk.empty())
	{
		pair<int,int> top = *dijk.begin();
		dijk.erase(top);
		int v = top.second;
		int d = top.first;
		for (int i = 1; i < n; ++i)
		{
			int d2 = d+A[i];
			int v2 = (v+A[i])%A[0];
			if(d2 < dist[v2])
			{
				if(dist[v2] < INF)
					dijk.erase(make_pair(dist[v2],v2));
				dist[v2] = d2;
				dijk.insert(make_pair(dist[v2],v2));
			}
		}
	}
	int k;
	scanf("%d", &k);
	while(k--)
	{
		int x;
		scanf("%d", &x);
		if(dist[x%A[0]] <= x)
			printf("TAK\n");
		else
			printf("NIE\n");
	}
	return 0;
}