#include<iostream>
#include<cassert>
#include<random>
using namespace std;
int N,Q;
int A[2<<17],B[2<<17];
long T[2<<17];
int R[2<<17],C[2<<17];
int ans[2<<17];
void solve()
{
	for(int i=0;i<Q;i++)
	{
		if(R[i]==0)ans[i]=A[C[i]];
		else if(C[i]==0)ans[i]=B[R[i]];
		else ans[i]=-1;
	}
	if(N==1)return;
	if(A[1]!=B[1])
	{
		for(int i=0;i<Q;i++)if(ans[i]==-1)ans[i]=T[i]%2;
		return;
	}
	int h=1;
	while(h+1<N&&B[h]!=B[h+1])h++;
	int w=1;
	while(w+1<N&&A[w]!=A[w+1])w++;
	for(int i=0;i<Q;i++)if(ans[i]==-1)
	{
		if(R[i]>h||C[i]>w)ans[i]=T[i]%2;
		else
		{
			if(R[i]+C[i]-1>T[i])ans[i]=T[i]%2;
			else
			{
				if(A[1]==0)ans[i]=1-(R[i]+C[i])%2;
				else ans[i]=(R[i]+C[i])%2;
			}
		}
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	/*
	mt19937 rng;
	N=5;
	while(true)
	{
		for(int i=0;i<5;i++)A[i]=rng()%2,B[i]=rng()%2;
		int X[5][5]={};
		for(int i=0;i<5;i++)X[0][i]=A[i];
		for(int i=1;i<5;i++)X[i][0]=B[i];
		for(int t=0;t<=10;t++)
		{
			Q=N*N;
			for(int i=0;i<N;i++)for(int j=0;j<N;j++)T[i*N+j]=t,R[i*N+j]=i,C[i*N+j]=j;
			solve();
			for(int i=0;i<N;i++)for(int j=0;j<N;j++)assert(X[i][j]==ans[i*N+j]);
			for(int i=N;--i;)for(int j=N;--j;)
			{
				int c=X[i][j]+X[i-1][j]+X[i][j-1];
				X[i][j]=c>=2?0:1;
			}
		}
		cout<<"AC"<<endl;
	}
	*/
	cin>>N;
	for(int i=0;i<N;i++)cin>>A[i];
	for(int i=1;i<N;i++)cin>>B[i];
	cin>>Q;
	for(int i=0;i<Q;i++)
	{
		cin>>T[i]>>R[i]>>C[i];
		R[i]--,C[i]--;
	}
	solve();
	for(int i=0;i<Q;i++)cout<<ans[i]<<"\n";
}