#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> pippi;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
int iinf=1<<30;
double pi=3.141592653589793238462643383279L;
double eps=1e-8;
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<int,int,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    if(k<0)return 0;
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}


struct LST{
private:
    int n;
    vector<ll> node,lazy;
    vector<bool> flag;
public:
    LST(vector<ll> v){
        ll sz=v.size();
        n=1;while(n<sz)n*=2;
        node.resize(2*n-1);
        lazy.resize(2*n-1,0);
        flag.resize(2*n-1,false);
        rep(i,0,sz)node[i+n-1]=v[i];
        rrep(i,n-2,0)node[i]=node[i*2+1]+node[i*2+2];
    }
    void eval(ll k,ll l,ll r){
        if(flag[k]){
            node[k]=lazy[k];
            if(r-l>1){
                lazy[2*k+1]=lazy[k]/2;
                lazy[2*k+2]=lazy[k]/2;
                flag[2*k+1]=flag[2*k+2]=true;
            }
            flag[k]=false;
        }
    }
    void update(ll a,ll b,ll x,ll k=0,ll l=0,ll r=-1){
        if(a>=b)return;
        if(r<0)r=n;
        eval(k,l,r);
        if(b<=l||r<=a)return;
        if(a<=l&&r<=b){
            lazy[k]=(r-l)*x;
            flag[k]=true;
            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);
            node[k]=node[2*k+1]+node[2*k+2];
        }
    }
    ll sum(ll a,ll b,ll k=0,ll l=0,ll r=-1){
        if(a>=b)return 0;
        if(r<0)r=n;
        eval(k,l,r);
        if(b<=l||a>=r)return 0;
        if(a<=l&&b>=r)return node[k];
        ll m1=sum(a,b,2*k+1,l,(l+r)/2);
        ll m2=sum(a,b,2*k+2,(l+r)/2,r);
        return m1+m2;
    }
};



int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n;cin>>n;
    LST seg1(vector<ll>(40001,0)),seg2(vector<ll>(40001,0));
    int a,b,c,d;
    ll sum;
    ll r;
    rep(i,0,n){
        cin>>a>>b>>c>>d;
        a+=20000;c+=20000;
        b=-b;
        sum=0;
        ll u=20001,D=0;
        
        while(u-D>1){
            int mid=(u+D)/2;
            r=seg1.sum(mid-1,mid);
            if(r>=d){
                u=mid;
            }
            else D=mid;
        }
        
        ll uu=40001,dd=20000;
        while(uu-dd>1){
            int mid=(uu+dd)/2;
            r=seg1.sum(mid-1,mid);
            if(r>=d){
                dd=mid;
            }
            else uu=mid;
        }
        //cout<<D<<" "<<dd<<" "<<a<<" "<<c<<endl;
        //cout<<seg1.sum(19997,20000)<<endl;
        sum+=(max((ll)0,D-a))*d-seg1.sum(a,D)+(max((ll)0,c-dd))*d-seg1.sum(dd,c);
        //cout<<d<<endl;
        seg1.update(a,D,d);
        seg1.update(dd,c,d);
        //rep(j,19998,20002)cout<<seg1.sum(j,j+1)<<" ";
        //cout<<endl;
        u=20001,D=0;
        while(u-D>1){
            int mid=(u+D)/2;
            r=seg2.sum(mid-1,mid);
            if(r>=b){
                u=mid;
            }
            else D=mid;
        }
        uu=40001,dd=20000;
        while(uu-dd>1){
            int mid=(uu+dd)/2;
            r=seg2.sum(mid-1,mid);
            if(r>=b){
                dd=mid;
            }
            else uu=mid;
        }
        sum+=(max((ll)0,D-a))*b-seg2.sum(a,D)+(max((ll)0,c-dd))*b-seg2.sum(dd,c);
        
        seg2.update(a,D,b);
        seg2.update(dd,c,b);
        cout<<sum<<endl;
        //rep(j,19997,20003)cout<<seg1.sum(j,j+1)<<" ";
        //cout<<endl;
    }
}