#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n), b(n);
  rep(i, n) cin >> a[i];
  for (int i = 1; i < n; i++) cin >> b[i];
  b[0] = a[0];
  int q;
  cin >> q;
  int h = 1, w = 1;
  if (n >= 2 && a[1] == b[1]) {
    h = 2, w = 2;
    while (w < n && a[w-1] != a[w]) w++;
    while (h < n && b[h-1] != b[h]) h++;
  }
  rep(iq, q) {
    ll t;
    int i, j;
    cin >> t >> i >> j;
    i--, j--;
    int ans = [&]() -> int {
      if (i == 0 || j == 0) return i == 0 ? a[j] : b[i];
      if (i + j <= t + 1 && i < h && j < w) return (a[1] ^ i ^ j ^ 1) & 1;
      return t % 2;
    }();
    cout << ans << '\n';
  }
}