#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
#define repr(i,n) for(int i=int(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
using Modint = atcoder::static_modint<998244353>;
//#include "nachia/vec.hpp"
using namespace std;

void testcase(){
    int N; cin >> N;
    vector<int> A(N); rep(i,N) cin >> A[i];
    vector<int> B(N); rep(i,N) if(i) cin >> B[i];
    B[0] = A[0];
    int x = 1;
    int y = 1;
    if(N == 1 || A[1] != B[1]){ x = y = 0; }
    else{
        while(x+1 < N && A[x] != A[x+1]) x++;
        while(y+1 < N && B[y] != B[y+1]) y++;
    }
    int Q; cin >> Q;
    i64 dil = A[1] ^ 1;
    rep(q,Q){
        i64 t; cin >> t;
        int r,c; cin >> r >> c; r--; c--;
        if(r == 0){ cout << A[c] << '\n'; }
        else if(c == 0){ cout << B[r] << '\n'; }
        else if(r <= y && c <= x){
            if(t >= dil + r-1 + c-1){
                cout << ((dil + r + c) % 2) << '\n';
            } else {
                cout << (t%2) << '\n';
            }
        } else {
            cout << (t%2) << '\n';
        }
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}