#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,Q;
int A[202020],B[202020];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) cin>>A[i];
	FOR(i,N-1) cin>>B[i+1];
	int miC=N-1;
	int miR=N-1;
	for(i=N-1;i>=2;i--) {
		if(A[i-1]==A[i]) miC=i;
		if(B[i-1]==B[i]) miR=i;
	}
	
	
	cin>>Q;
	while(Q--) {
		ll T,R,C;
		cin>>T>>R>>C;
		R--,C--;
		if(R==0) {
			cout<<A[C]<<endl;
		}
		else if(C==0) {
			cout<<B[R]<<endl;
		}
		else {
			if(A[1]!=B[1]) {
				cout<<T%2<<endl;
			}
			else {
				if(R<=miR&&C<=miC&&R+C-1<=T) {
					cout<<(R+C)%2<<endl;
				}
				else {
					cout<<T%2<<endl;
				}
			}
		}
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}