#include #if __has_include() #include using namespace atcoder; #endif using namespace std; // #include "boost/multiprecision/cpp_int.hpp" // using namespace boost::multiprecision; // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #define ll long long #define rep(i, n) for (ll i = 0; i < n; ++i) #define rep_up(i, a, n) for (ll i = a; i < n; ++i) #define rep_down(i, a, n) for (ll i = a; i >= n; --i) #define P pair #define pb push_back #define bit_count(x) __builtin_popcountll(x) #define gcd(a, b) __gcd(a, b) #define lcm(a, b) a / gcd(a, b) * b // #define endl "\n" #define all(v) v.begin(), v.end() #define fi first #define se second #define vll vector #define vvll vector #define vvvll vector #define vvvvll vector #define pqll priority_queue #define pqllg priority_queue, greater> template inline void vin(vector &v) { rep(i, v.size()) cin >> v.at(i); } template using V = vector; constexpr ll INF = (1ll << 60); // constexpr ll mod = 1000000007; constexpr ll mod = 998244353; // using mint = atcoder::modint; using mint = atcoder::modint998244353; // using mint = atcoder::modint1000000007; #define vmint vector #define vvmint vector #define vvvmint vector #define vvvvmint vector constexpr double pi = 3.14159265358979323846; random_device seed_gen; mt19937 engine(seed_gen()); template inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; } template void pt(T val) { cout << val << "\n"; } template void pt_vll(vector &v) { ll vs = v.size(); rep(i, vs) { cout << v[i]; if (i == vs - 1) cout << "\n"; else cout << " "; } } template void pt_vmint(vector &v) { ll vs = v.size(); rep(i, vs) { cout << v[i].val(); if (i == vs - 1) cout << "\n"; else cout << " "; } } ll mypow(ll a, ll n) { ll ret = 1; if (n == 0) return 1; if (a == 0) return 0; rep(i, n) { if (ret > (ll)(9e18 + 10) / a) return -1; ret *= a; } return ret; } long long modpow(long long a, long long n, long long mod) { long long res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } long long modinv(long long a, long long m) { long long b = m, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= m; if (u < 0) u += m; return u; } void solve(); // ここまでテンプレ int main() { ios::sync_with_stdio(false); cin.tie(nullptr); // cout << fixed << setprecision(16); // ll T; // cin >> T; // rep(ca, T) solve(); } ll nand(ll x, ll y) { if (x == 1 && y == 1) return 0; return 1; } ll nor(ll x, ll y) { if (x == 0 && y == 0) return 1; return 0; } void solve() { ll n, m, k, cnt = 0, sum = 0, ans = 0; cin >> n; // ll T = 2 * n; // vvvll z(T + 1, vvll(n, vll(n))); vll x(n); vll y(n); vin(x); // rep(i, n) // { // x[0][0][i] = 0; // } y[0] = x[0]; rep(i, n - 1) { // x[0][i + 1][0] = 0; cin >> y[i + 1]; } // rep(i, n) // { // z[0][0][i] = x[i]; // z[0][i][0] = y[i]; // } // rep(t, T) // { // rep(i, n) // { // rep(j, n) // { // cout << z[t][i][j]; // } // cout << endl; // } // cout << "----" << endl; // rep_up(i, 0, n) // { // rep_up(j, 0, n) // { // if (i == 0 || j == 0) // z[t + 1][i][j] = z[t][i][j]; // else if (z[t][i][j] == 0) // z[t + 1][i][j] = nand(z[t][i - 1][j], z[t][i][j - 1]); // else // z[t + 1][i][j] = nor(z[t][i - 1][j], z[t][i][j - 1]); // } // } // } ll mx = n; ll my = n; rep(i, n) { if (i > 1 && x[i] == x[i - 1]) { my = i; break; } } rep(i, n) { if (i > 1 && y[i] == y[i - 1]) { mx = i; break; } } rep(i, n) { if (x[i] != y[i]) { chmin(mx, i); chmin(my, i); } } // pt(m); mx--; my--; ll q; cin >> q; rep(i, q) { ll t, r, c; cin >> t >> r >> c; r--; c--; if (r == 0 || c == 0) { if (r == 0) ans = x[c]; else ans = y[r]; } else if (r > mx || c > my || (r + c) > t + 1) { ans = t % 2; } else { // ans = "a"); // pt("a"); // cout << "a" << endl; ll p = x[1] + r + c + 1; ans = p % 2; } cout << ans << endl; // if (t < T) // assert(ans == z[t][r][c]); } }