#include <bits/stdc++.h>
#include<atcoder/all>
using namespace atcoder;
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vvvvvb = vector<vvvvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}
ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;
}


using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;


vector<mint> fact, factinv, inv, factK;
const ll mod = 998244353;
void prenCkModp(ll n) {
    //factK.resize(4*n+5);
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - ((inv[mod % i] * (mod / i))));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }
    //factK[0]=1;
    //for(ll i=1;i<4*n+5;i++){
    //    factK[i]=factK[i-1]*mint(K-i+1);
    //    //K*(K-1)*...*(K-i+1);
    //}
}
mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}
//mint nCkK(ll n,ll k){
//    if(K<n||K-n<k)return 0;
//    mint res=factK[n+k];
//    res*=factK[n].inv();
//    res*=factinv[k];
//    return res;
//}


bool DEB = 0;



int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N;
    cin>>N;
    // vvll A(N,vll(N));
    // rep(i,N)cin>>A[0][i];
    // rep(i,N-1)cin>>A[i+1][0];

    // rep(t,100){
    //     rep(i,N){
    //         rep(j,N){
    //             cout<<A[i][j];
    //         }
    //         cout<<endl;
    //     }
    //     cout<<endl;

    //     vvll NA(N,vll(N));
    //     rep(i,N)rep(j,N){
    //         if(i*j==0)NA[i][j]=A[i][j];
    //         else if(A[i][j]==0){
    //             NA[i][j]=!(A[i][j-1]&A[i-1][j]);
    //         }
    //         else{
    //             NA[i][j]=!(A[i][j-1]|A[i-1][j]);
    //         }
    //     }
    //     swap(A,NA);
        
    // }


    vll A(N);
    vll B(N);
    rep(i,N)cin>>A[i];
    rep(i,N-1)cin>>B[i+1];
    B[0]=A[0];
    
    ll Q;
    cin>>Q;
    if(N==1){
        ll Q;
        cin>>Q;
        rep(q,Q){
            ll T;
            cin>>T>>T>>T;
            cout<<B[0]<<endl;
        }
        return 0;
    }
    if(A[1]!=B[1]){
        rep(q,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 cout<<T%2<<endl;
        }
        return 0;
    }
    ll W=N,H=N;
    rep(i,N-2){
        if(A[i+1]==A[i+2]){
            W=i+2;
            break;
        }
    }
    rep(i,N-2){
        if(B[i+1]==B[i+2]){
            H=i+2;
            break;
        }
    }
    // cout<<W<<" "<<H<<endl;
    rep(q,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(R+C>=T+2||R>=H||C>=W){
            cout<<T%2<<endl;
        }
        else{
            cout<<((A[C]^B[R])^(!A[1]))<<endl;
        }
    }

}