#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>

const int MAX_N = 50000;

#define getchar getchar_unlocked
#define putchar putchar_unlocked

inline int in() {
    int n = 0; short c;
    while ((c = getchar()) >= '0') n = n * 10 + c - '0';
    return n;
}

inline unsigned long long inll() {
    unsigned long long n = 0; short c;
    while ((c = getchar()) >= '0') n = n * 10 + c - '0';
    return n;
}

inline void out(unsigned long long n) {
    short res[20], i = 0;
    do { res[i++] = n % 10, n /= 10; } while (n);
    while (i) putchar(res[--i] + '0');
    putchar('\n');
}

struct info {
    int lower, upper, color;
    info() : info(2 * MAX_N + 1, -1, 0){}
    info(const int _lower, const int _upper, const int _color)
        : lower(_lower), upper(_upper), color(_color){}
};

info upx[2 * MAX_N], upy[2 * MAX_N];

int main()
{
    // std::cin.tie(0);
    // std::ios::sync_with_stdio(false);
    int N;
    // std::cin >> N;
    N = in();
    std::vector<unsigned long long> h(N);
    for(int i = 0; i < N; ++i){
        // std::cin >> h[i];
        h[i] = inll();
    }
    for(int i = 0; i < N; ++i){
        int a, b, c, d, e;
        // std::cin >> a >> b >> c >> d >> e;
        a = in(), b = in(), c = in(), d = in(), e = in();
        upx[a] = {b, d, e}, upx[c] = {b, d, -e}, upy[b] = {a, c, e}, upy[d] = {a, c, -e};
    }
    int Q;
    // std::cin >> Q;
    Q = in();
    std::vector<std::pair<int, int> > z(Q);
    std::vector<int> ord(Q);
    std::iota(ord.begin(), ord.end(), 0);
    for(int i = 0; i < Q; ++i){
        int p, q;
        // std::cin >> p >> q;
        p = in(), q = in();
        z[i] = {p, q};
    }
    const int width = (1 << 10);
    // const int width = ceil(sqrt(2 * N));
    std::sort(ord.begin(), ord.end(), [&](const int a, const int b){
        const int u = z[a].first >> 10, v = z[b].first >> 10;
        return (u == v) ? (z[a].second < z[b].second) : (u < v);
    });
    std::vector<unsigned long long> ans(Q);
    std::vector<int> C(N, 0);
    unsigned long long cur_hash = 0;
    int prv = -1, curx = -1, cury = -1;
    for(const int id : ord){
        const int cur = z[id].first >> 10;
        if(prv != cur){
            fill(C.begin(), C.end(), 0), cur_hash = 0, prv = cur, curx = cur * width - 1, cury = -1;
        }
        // left
        while(curx > z[id].first){
            if(upx[curx].lower <= cury && cury < upx[curx].upper){
                const int c = upx[curx].color;
                if(c > 0){
                    if(--C[c - 1] == 0) cur_hash ^= h[c - 1];
                }else{
                    if(++C[-c - 1] == 1) cur_hash ^= h[-c - 1];
                }
            }
            --curx;
        }
        // right
        while(curx < z[id].first){
            ++curx;
            if(upx[curx].lower <= cury && cury < upx[curx].upper){
                const int c = upx[curx].color;
                if(c > 0){
                    if(++C[c - 1] == 1) cur_hash ^= h[c - 1];
                }else{
                    if(--C[-c - 1] == 0) cur_hash ^= h[-c - 1];
                }
            }
        }
        // up
        while(cury < z[id].second){
            ++cury;
            if(upy[cury].lower <= curx && curx < upy[cury].upper){
                const int c = upy[cury].color;
                if(c > 0){
                    if(++C[c - 1] == 1) cur_hash ^= h[c - 1];
                }else{
                    if(--C[-c - 1] == 0) cur_hash ^= h[-c - 1];
                }
            }
        }
        ans[id] = cur_hash;
    }
    for(int i = 0; i < Q; ++i){
        // std::cout << ans[i] << "\n";
        out(ans[i]);
    }
    return 0;
}