#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

#define NDEBUG
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return ((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
template<typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template<typename T>
std::vector<T> read_vec(const std::size_t size)
{
    std::vector<T> v(size);
    for (auto& e : v) { std::cin >> e; }
    return v;
}
template<typename... Types>
auto read_vals() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#define SHOW(...) static_cast<void>(0)
template<typename T>
std::vector<T> make_v(const std::size_t size, T v) { return std::vector<T>(size, v); }
template<class... Args>
auto make_v(const std::size_t size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }
int main()
{
    const usize N = read<usize>();
    std::vector<ull> h(N + 1, 0ULL);
    for (usize i = 1; i <= N; i++) { h[i] = read<ull>(); }

    const usize L = 2 * N;
    std::vector<usize> a(N + 1, 0), b(N + 1, 0), c(N + 1, L), d(N + 1, L), e(N + 1, 0);
    std::vector<int> lr(L + 1, 0), du(L + 1, 0);  // 左右矢印,上下矢印
    for (int i = 1; i <= N; i++) {
        std::tie(a[i], b[i], c[i], d[i], e[i]) = read_vals<usize, usize, usize, usize, usize>();
        lr[++a[i]] = du[++b[i]] = i, lr[++c[i]] = du[++d[i]] = -i;
    }

    const usize Q = read<usize>();
    std::vector<usize> p(Q), q(Q);
    for (usize i = 0; i < Q; i++) { p[i] = read<usize>() + 1, q[i] = read<usize>() + 1; }

    constexpr usize BS = 300;
    std::vector<usize> inds(Q);
    std::iota(inds.begin(), inds.end(), 0UL);
    std::sort(inds.begin(), inds.end(), [&](const usize i, const usize j) {
        const usize bi = p[i] / BS, bj = p[j] / BS;
        return bi != bj ? bi < bj : q[i] != q[j] ? q[i] < q[j] : p[i] < p[j];
    });

    std::vector<usize> color_cnt(N + 1, 0);
    ull hash      = 0;
    auto add_film = [&](const usize i) {  // フィルムiを追加
        const usize c = e[i];
        if (color_cnt[c]++ == 0) { hash ^= h[c]; }
    };
    auto del_film = [&](const usize i) {  // フィルムiを削除
        const usize c = e[i];
        if (--color_cnt[c] == 0) { hash ^= h[c]; }
    };
    auto add_del_film = [&](const int i) {
        if (i > 0) { add_film(i); }
        if (i < 0) { del_film(-i); }
    };

    std::vector<ull> answer(Q);
    usize x = 0, y = 0;
    auto von = [&](const usize x, const usize y) { return b[std::abs(lr[x])] <= y and y < d[std::abs(lr[x])]; };
    auto hon = [&](const usize x, const usize y) { return a[std::abs(du[y])] <= x and x < c[std::abs(du[y])]; };
    for (const usize i : inds) {
        const usize nx = p[i], ny = q[i];  // 次のクエリ点
        while (x < nx) {
            x++;
            if (von(x, y)) { add_del_film(lr[x]); }
        }
        while (x > nx) {
            if (von(x, y)) { add_del_film(-lr[x]); }
            x--;
        }
        while (y < ny) {
            y++;
            if (hon(x, y)) { add_del_film(du[y]); }
        }
        while (y > ny) {
            if (hon(x, y)) { add_del_film(-du[y]); }
            y--;
        }
        answer[i] = hash;
    }

    for (usize i = 0; i < Q; i++) { std::cout << answer[i] << std::endl; }

    return 0;
}