#include "mosaic.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#include <vector>

int solve(int x1 , int x2 , int y1 , int y2){
  if (x1 == 0) x1++;
  if (y1 == 0) y1++;

  if (x1 > x2 || y1 > y2) return 0; 
  int h = x2 - x1 + 1 , w = y2 - y1 + 1; 
  //cout << h << ' ' << w << ' ' ; 
  int ans = 0; 
  if (h % 2 == 0 && w % 2 == 0) ans =  (h * w) / 2; 
  else if (h % 2 == 0) ans =  (h/2 * w); 
  else if (w % 2 == 0) ans =  (w/2 * h); 
  else ans = (((h-1)/2 * w) + (w + (x1%2 == y1%2))/2); 
  //cout << ans << ' '; 
  //cout << '\n'; 
  return ans;
}

std::vector<long long> mosaic(std::vector<signed> X, std::vector<signed> Y, std::vector<signed> T, std::vector<signed> B , std::vector<signed> L, std::vector<signed> R) {
  int Q = T.size() , N = X.size();
  vector<int> ans(Q); 
  // int a[N][N] = {};
  // for (int j = 0 ; j < N ; j++){
  //   a[0][j] = X[j]; 
  // }
  // for (int i = 0 ; i < N ; i++){
  //   a[i][0] = Y[i]; 
  // }

  // for (int i = 1 ; i < N ; i++){
  //   for (int j = 1 ; j < N ; j++){
  //     a[i][j] = (!a[i-1][j] && !a[i][j-1]); 
  //   }
  // }

  // for (int i = 0 ; i < N ; i++){
  //   for (int j = 0 ; j < N ; j++){
  //     cout << a[i][j]; 
  //   }
  //   cout << '\n';
  // }

  for (int i = 0 ; i < Q ; i++){
    ans[i] = solve(T[i] , B[i] , L[i] , R[i]);
  }
  return ans; 
}