#include<cstdio>
#include<map>
using namespace std;
typedef long long ll;
const int N=50005,M=1000005;
struct TPoint{
int x,y,z;
TPoint(){}
TPoint(int _x,int _y,int _z):x(_x),y(_y),z(_z){}
TPoint operator-(const TPoint&p)const{return TPoint(x-p.x,y-p.y,z-p.z);}
TPoint operator*(const TPoint&p)const{return TPoint(y*p.z-z*p.y,z*p.x-x*p.z,x*p.y-y*p.x);}
ll operator^(const TPoint&p)const{return 1LL*x*p.x+1LL*y*p.y+1LL*z*p.z;}
void read(){scanf("%d%d%d",&x,&y,&z);}
};
int n;
TPoint ply[N],p;
int trianglecnt,cnt,pool[M];
map<int,int>vis[N];
struct fac{
int a,b,c;
bool ok;
TPoint v;
fac(){}
fac(int _a,int _b,int _c){
a=_a,b=_b,c=_c;
ok=1;
v=(ply[b]-ply[a])*(ply[c]-ply[a]);
}
}tri[M];
inline bool nonempty(const TPoint&p){return p.x||p.y||p.z;}
inline ll ptoplane(const TPoint&p,const fac&f){return f.v^(p-ply[f.a]);}
void dfs(int p,int cnt);
void deal(int p,int a,int b){
int f=vis[a][b];
if(!tri[f].ok)return;
if(ptoplane(ply[p],tri[f])>0)dfs(p,f);else{
vis[p][b]=vis[a][p]=vis[b][a]=trianglecnt;
pool[cnt++]=trianglecnt;
tri[trianglecnt++]=fac(b,a,p);
}
}
void dfs(int p,int cnt){
tri[cnt].ok=0;
deal(p,tri[cnt].b,tri[cnt].a);
deal(p,tri[cnt].c,tri[cnt].b);
deal(p,tri[cnt].a,tri[cnt].c);
}
void construct(){
int i,j;
for(i=1;i<n;i++)if(nonempty(ply[0]-ply[i])){
swap(ply[1],ply[i]);
break;
}
for(i=2;i<n;i++)if(nonempty((ply[0]-ply[1])*(ply[1]-ply[i]))){
swap(ply[2],ply[i]);
break;
}
for(i=3;i<n;i++)if(((ply[0]-ply[1])*(ply[1]-ply[2]))^(ply[0]-ply[i])){
swap(ply[3],ply[i]);
break;
}
for(i=0;i<4;i++){
fac add((i+1)%4,(i+2)%4,(i+3)%4);
if(ptoplane(ply[i],add)>0)swap(add.b,add.c);
add.v=(ply[add.b]-ply[add.a])*(ply[add.c]-ply[add.a]);
vis[add.a][add.b]=vis[add.b][add.c]=vis[add.c][add.a]=trianglecnt;
tri[trianglecnt++]=add;
}
cnt=trianglecnt;
for(i=0;i<cnt;i++)pool[i]=i;
for(i=4;i<n;i++)for(j=0;j<cnt;j++)if(ptoplane(ply[i],tri[pool[j]])>0){
dfs(i,pool[j]);
int m=0;
for(j=0;j<cnt;j++)if(tri[pool[j]].ok)pool[m++]=pool[j];
cnt=m;
break;
}
cnt=0;
for(i=0;i<trianglecnt;i++)if(tri[i].ok)tri[cnt++]=tri[i];
}
inline bool outside(const TPoint&p){
for(int i=0;i<cnt;i++)if(ptoplane(p,tri[i])>0)return 1;
return 0;
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++)ply[i].read();
construct();
scanf("%d",&n);
while(n--)p.read(),puts(outside(p)?"0":"1");
}