#include "bits/stdc++.h"
#define ll long long
using namespace std;
vector <ll> mosaic(vector <int> x,vector <int> y,vector <int> t,vector <int> b,vector <int> l,vector <int> r){
int n = x.size();
int q = t.size();
vector <vector <int>> a(n,vector <int> (n));
for (int i = 0;i < n;i++){
a[i][0] = y[i];
}
for (int i = 0;i < n;i++){
a[0][i] = x[i];
}
for (int i = 1;i < n;i++){
for (int j = 1;j < n;j++){
if (!a[i-1][j] && !a[i][j-1])
a[i][j] = 1;
}
}
vector <vector <ll>> pr(n+1,vector <ll> (n+1));
for (int i = 1;i <= n;i++){
for (int j = 1;j <= n;j++){
pr[i][j] = pr[i-1][j]+pr[i][j-1]-pr[i-1][j-1]+a[i-1][j-1];
}
}
vector <ll> p(q);
for (int k = 0;k < q;k++){
t[k]++;b[k]++;l[k]++;r[k]++;
p[k] = pr[b[k]][r[k]] - pr[t[k]-1][r[k]] - pr[b[k]][l[k]-1] + pr[t[k]-1][l[k]-1];
}
return p;
}
// int main(){
// int n;
// cin >> n;
// vector <int> x(n),y(n);
// for (int i = 0;i < n;i++){
// cin >> x[i];
// }
// for (int i = 0;i < n;i++){
// cin >> y[i];
// }
// int q;
// cin >> q;
// vector <int> t(q),b(q),l(q),r(q);
// for (int i = 0;i < q;i++){
// cin >> t[i] >> b[i] >> l[i] >> r[i];
// }
// vector <ll> p = mosaic(x,y,t,b,l,r);
// for (int i = 0;i < q;i++){
// cout << p[i] << "\n";
// }
// }
