segtree<ll>t[4];
ll n,u,v,a,b,c,d,i,h;
{
	t[0..3].walloc(2d4,1);
	rd(n);
	rep(n){
		rd(a,b,c,d);
		rep(i,4){
			t[i].change(bsearch_min[ll,h,0,c](t[i].getSum(h,h+1)<d),c,d);
			u+=t[i].getSum(0,2d4);
			(a,b,c,d)=(-d,a,-b,c);
		}
		wt(u-v);
		v=u,u=0;
	}
}