#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
void err_print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cerr << v[i] + x << ' ';
    cerr << endl;
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

struct Random_Number_Generator {
    mt19937_64 mt;

    Random_Number_Generator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}

    // 区間 [l,r) の整数で乱数発生
    int64_t operator()(int64_t l, int64_t r) {
        uniform_int_distribution<int64_t> dist(l, r - 1);
        return dist(mt);
    }

    // 区間 [0,r) の整数で乱数発生
    int64_t operator()(int64_t r) { return (*this)(0, r); }
} rng;

void solve() {
    int N;
    cin >> N;

    vector<int> a(N, 0), b(N, 0);
    rep(i, N) cin >> a[i];
    rep2(i, 1, N) cin >> b[i];

    int x = 1, y = 1;
    while (x < N && (a[1] + x - 1) % 2 == a[x] % 2) x++;
    while (y < N && (b[1] + y - 1) % 2 == b[y] % 2) y++;

    int Q;
    cin >> Q;

    while (Q--) {
        ll T;
        int i, j;
        cin >> T >> i >> j;
        i--, j--;

        if (i == 0) {
            cout << a[j] << '\n';
        } else if (j == 0) {
            cout << b[i] << '\n';
        } else if (a[1] != b[1]) {
            cout << T % 2 << '\n';
        } else if (i >= x || j >= y) {
            cout << T % 2 << '\n';
        } else if (T >= i + j - 1) {
            if (a[1] == 0) {
                cout << (i + j + 1) % 2 << '\n';
            } else {
                cout << (i + j) % 2 << '\n';
            }
        } else {
            cout << T % 2 << '\n';
        }
    }

    // vector<vector<int>> a(N, vector<int>(N, 0));
    // // rep(i, N) a[0][i] = rng(2), a[i][0] = rng(2);
    // rep(i, N) cin >> a[0][i];
    // rep(i, N) cin >> a[i][0];

    // rep(_, 10) {
    //     rep(i, N) print(a[i]);
    //     cout << "----------------------------------------------\n";
    //     auto b = a;
    //     rep2(i, 1, N) rep2(j, 1, N) {
    //         if (a[i][j] == 0) {
    //             b[i][j] = (a[i - 1][j] & a[i][j - 1]) ^ 1;
    //         } else {
    //             b[i][j] = (a[i - 1][j] | a[i][j - 1]) ^ 1;
    //         }
    //     }
    //     swap(a, b);
    // }
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
}