#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<typename Monoid, typename OperatorMonoid=Monoid>
struct LazySegmentTree{
	using F=function<Monoid(Monoid, Monoid)>;
	using G=function<Monoid(Monoid, OperatorMonoid, int)>;
	using H=function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;
	int sz;
	vector<Monoid> data;
	vector<OperatorMonoid> lazy;
	const F f;
	const G g;
	const H h;
	const Monoid e1;
	const OperatorMonoid e0;

	LazySegmentTree(int n, const F f, const G g, const H h, const Monoid &e1, const OperatorMonoid &e0): f(f), g(g), h(h), e1(e1), e0(e0){
		sz=1;
		while(sz<n) sz<<=1;
		data.resize(2*sz-1, e1);
		lazy.resize(2*sz-1, e0);
	}

	void build(vector<Monoid> v){
		for(int i=0; i<v.size(); i++) data[i+sz-1]=v[i];
		for(int i=sz-2; i>=0; i--) data[i]=f(data[2*i+1], data[2*i+2]);
	}

	void eval(int k, int l, int r){
		if(lazy[k]!=e0){
			data[k]=g(data[k], lazy[k], r-l);
			if(k<sz-1){
				lazy[2*k+1]=h(lazy[2*k+1], lazy[k]);
				lazy[2*k+2]=h(lazy[2*k+2], lazy[k]);
			}
		}
		lazy[k]=e0;
	}

	void update(int a, int b, const OperatorMonoid &x, int k, int l, int r){
		eval(k, l, r);
		if(r<=a || b<=l) return;
		if(a<=l && r<=b){
			lazy[k]=h(lazy[k], x);
			eval(k, l, r);
		}else{
			update(a, b, x, 2*k+1, l, (l+r)/2);
			update(a, b, x, 2*k+2, (l+r)/2, r);
			data[k]=f(data[2*k+1], data[2*k+2]);
		}
	}
	void update(int a, int b, const OperatorMonoid &x){
		return update(a, b, x, 0, 0, sz);
	}

	Monoid find(int a, int b, int k, int l, int r){
		eval(k, l, r);
		if(b<=l || r<=a) return e1;
		if(a<=l && r<=b) return data[k];
		else return f(find(a, b, 2*k+1, l, (l+r)/2), find(a, b, 2*k+2, (l+r)/2, r));
	}
	Monoid find(int a, int b){
		return find(a, b, 0, 0, sz);
	}
	Monoid operator[](const int &k){
		return find(k, k+1);
	}
};
vector<ll> solve(int n, vector<int> vx, vector<int> vy){
    int m=20000;
    auto f=[](ll x, ll y){ return x+y;};
    auto g=[](ll a, ll x, int len){ return x*len;};
    auto h=[](ll x, ll y){ return y;};
    LazySegmentTree<ll> seg(m, f, g, h, 0, 0);
    vector<ll> ans(n);
    for(int i=0; i<n; i++){
        if(seg[vx[i]-1]>=vy[i]){
            continue;
        }
        if(seg[0]<vy[i]){
            ll s=seg.find(0, vx[i]);
            ans[i]=vx[i]*(ll)vy[i]-s;
            seg.update(0, vx[i], vy[i]);
            continue;
        }
        int l=0, r=vx[i]-1;
        while(r-l>1){
            int mid=(l+r)/2;
            if(seg[mid]<vy[i]) r=mid;
            else l=mid;
        }
        ll s=seg.find(r, vx[i]);
        ans[i]=(vx[i]-r)*(ll)vy[i]-s;
        seg.update(r, vx[i], vy[i]);
    }
    return ans;
}
int main()
{
    int n; cin>>n;
    ll xa[40040], ya[40040], xb[40040], yb[40040];
    for(int i=0; i<n; i++){
        cin>>xa[i]>>ya[i]>>xb[i]>>yb[i];
    }
    vector<int> vx(n), vy(n);
    for(int i=0; i<n; i++){
        vx[i]=-xa[i], vy[i]=-ya[i];
    }
    auto ans1=solve(n, vx, vy);
    for(int i=0; i<n; i++){
        vx[i]=xb[i], vy[i]=yb[i];
    }
    auto ans2=solve(n, vx, vy);
    for(int i=0; i<n; i++){
        vx[i]=xb[i], vy[i]=-ya[i];
    }
    auto ans3=solve(n, vx, vy);
    for(int i=0; i<n; i++){
        vx[i]=-xa[i], vy[i]=yb[i];
    }
    auto ans4=solve(n, vx, vy);
    for(int i=0; i<n; i++){
        cout<<ans1[i]+ans2[i]+ans3[i]+ans4[i]<<endl;
    }
    return 0;
}