/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}

void solve(){
    ll N;
    cin >> N;
    ll xa[40010], ya[40010], xb[40010], yb[40010];
    rep(i,0,N){
        cin >> xa[i] >> ya[i] >> xb[i] >> yb[i];
        xa[i] *= -1;
        ya[i] *= -1;
    }

    ll ans[40010] = {};
    ll cur[20010] = {};

    rep(i,0,N){
        rep(x,0,xb[i]){
            ll v = max(0LL, yb[i] - cur[x]);
            ans[i] += v;
        }
        rep(x,0,xb[i]){
            cur[x] = max(cur[x], yb[i]);
        }
    }
    fill(cur, cur+20010, 0);
    rep(i,0,N){
        rep(x,0,xb[i]){
            ll v = max(0LL, ya[i] - cur[x]);
            ans[i] += v;
        }
        rep(x,0,xb[i]){
            cur[x] = max(cur[x], ya[i]);
        }
    }
    fill(cur, cur+20010, 0);
    rep(i,0,N){
        rep(x,0,xa[i]){
            ll v = max(0LL, ya[i] - cur[x]);
            ans[i] += v;
        }
        rep(x,0,xa[i]){
            cur[x] = max(cur[x], ya[i]);
        }
    }
    fill(cur, cur+20010, 0);
    rep(i,0,N){
        rep(x,0,xa[i]){
            ll v = max(0LL, yb[i] - cur[x]);
            ans[i] += v;
        }
        rep(x,0,xa[i]){
            cur[x] = max(cur[x], yb[i]);
        }
    }

    rep(i,0,N) print(ans[i]);

    

}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}