#include <bits/stdc++.h>

using namespace std;

#ifdef lisie_bimbi
#else
#define endl '\n'
#endif
typedef long long ll;

#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,bmi2,fma")

const ll inf = 1'000'000'000;

struct lox{
    vector<vector<int>> a;
    vector<vector<int>> p;
    int n;
    int m;
    void init(){
        n = a.size();
        m = a[0].size();
        for(int i = 1; i < n; i++){
            for(int j = 1; j < m; j++){
                if((!a[i - 1][j]) && (!a[i][j - 1])){
                    a[i][j] = 1;
                }else{
                    a[i][j] = 0;
                }
            }
        }
        p.resize(n + 1, vector<int>(m + 1));
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                p[i + 1][j + 1] = p[i][j + 1] + p[i + 1][j] - p[i][j] + a[i][j];
            }
        }
    }
    int get(int x1, int y1, int x2, int y2){
        x1 = min(x1, n);
        y1 = min(y1, m);
        x2++;y2++;
        x2 = min(x2, n);
        y2 = min(y2, m);
        int ans = p[x2][y2] - p[x2][y1] - p[x1][y2] + p[x1][y1];
        return ans;
    }
};

int n;

lox A, B, C;

int tt(int x, int y){
    if(x <= 2){
        return B.a[x][y];
    }else if(y <= 2){
        return A.a[x][y];
    }else{
        int z = min(x - 2, y - 2);
        return tt(x - z, y - z);
    }
}

int tt2(int x, int y){
    if(x <= 2){
        
    }else if(y <= 2){
        
    }else{
        int z = min(x - 2, y - 2);
        x -= z;
        y -= z;
    }
    if(y == 2){
        return n - x - 1;
    }else if(x == 2){
        return (n - 3) * 2 + 1 - (n - y - 1) - 1;
    }
}

vector<ll> a;

struct pref1{
    vector<ll> p;
    int n;
    void init(){
        n = a.size();
        p.resize(n + 1);
        for(int i = 0; i < n; i++){
            p[i + 1] = p[i] + a[i];
        }
    }
    ll get(int l, int r){
        return p[r - 1] - p[l];
    }
};
pref1 p1;

struct pref2{
    vector<ll> p;
    int n;
    void init(){
        n = a.size();
        p.resize(n + 1);
        for(int i = 0; i < n; i++){
            p[i + 1] = p[i] + a[i] * (i + 1);
        }
    }
    ll get(int l, int r){
        return (p[r - 1] - p[l]) - p1.get(l, r) * l;
    }
};
pref2 p2;

struct pref3{
    vector<ll> p;
    int n;
    void init(){
        n = a.size();
        p.resize(n + 1);
        for(int i = 0; i < n; i++){
            p[i + 1] = p[i] + a[i] * (n - i);
        }
    }
    ll get(int l, int r){
        return (p[r - 1] - p[l]) - p1.get(l, r) * (n - r - 1);
    }
};
pref3 p3;



ll zzz(int l, int r, int t){
    return p2.get(l, l + t - 2) + p3.get(r - (t - 1) + 1, r) + t * p1.get(l + t - 1, r - (t - 1));
}

ll get(int x1, int y1, int x2, int y2){
    ll ans = A.get(x1, y1, x2, y2) + B.get(x1, y1, x2, y2) - C.get(x1, y1, x2, y2);
    x1 = max(3, x1);
    y1 = max(3, y1);
    if((x1 > x2) || (y1 > y2)){
        return ans;
    }
    if((x1 == x2) && (y1 == y2)){
        return ans + tt(x1, y1);
    }
    return ans + zzz(tt2(x2, y1), tt2(x1, y2), min(x2 - x1 + 1, y2 - y1 + 1));
}

vector<long long> mosaic(vector<int> x, vector<int> y, vector<int> X1, vector<int> X2, vector<int> Y1, vector<int> Y2){
    n = x.size();
    A.a.resize(n, vector<int>(3));
    B.a.resize(3, vector<int>(n));
    C.a.resize(3, vector<int>(3));
    for(int i = 0; i < n; i++){
        B.a[0][i] = x[i];
    }
    for(int i = 0; i < 3; i++){
        B.a[i][0] = y[i];
    }
    for(int i = 0; i < n; i++){
        A.a[i][0] = y[i];
    }
    for(int i = 0; i < 3; i++){
        A.a[0][i] = x[i];
    }
    for(int i = 0; i < 3; i++){
        C.a[i][0] = y[i];
    }
    for(int i = 0; i < 3; i++){
        C.a[0][i] = x[i];
    }
    A.init();
    B.init();
    C.init();
    for(int i = n - 1; i >= 2; i--){
        a.push_back(tt(i, 2));
    }
    for(int i = 3; i < n; i++){
        a.push_back(tt(2, i));
    }
    p1.init();
    p2.init();
    p3.init();
    int q = X1.size();
    vector<ll> ans(q);
    for(int i = 0; i < q; i++){
        ans[i] = get(X1[i], Y1[i], X2[i], Y2[i]);
    }
    return ans;
}

#ifdef lisie_bimbi

int main() {
#ifdef lisie_bimbi
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    cin.tie(nullptr)->sync_with_stdio(false);           
#endif    
    int N;
    assert(1 == scanf("%d", &N));
    std::vector<int> X(N), Y(N);
    for (int i = 0; i < N; i++)
        assert(1 == scanf("%d", &X[i]));
    for (int i = 0; i < N; i++)
        assert(1 == scanf("%d", &Y[i]));
    int Q;
    assert(1 == scanf("%d", &Q));
    std::vector<int> T(Q), B(Q), L(Q), R(Q);
    for (int k = 0; k < Q; k++)
        assert(4 == scanf("%d%d%d%d", &T[k], &B[k], &L[k], &R[k]));
    fclose(stdin);

    std::vector<long long> C = mosaic(X, Y, T, B, L, R);

    int S = (int)C.size();
    for (int k = 0; k < S; k++)
        printf("%lld\n", C[k]);
    fclose(stdout);

    return 0;
}

#endif

/*
signed main(){
#ifdef lisie_bimbi
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    cin.tie(nullptr)->sync_with_stdio(false);           
#endif
    

    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
  
}
*/