#include <bits/stdc++.h>

using namespace std;

using ll = long long;

constexpr char newl = '\n';

ll solve(ll x, ll y, map<ll, ll>& d) {
    auto itr = d.upper_bound(x);

    ll ng = 0, ok = 1e9;
    while (ok - ng > 1) {
        ll mid = (ok + ng) / 2;
        (d.lower_bound(mid)->second <= y ? ok : ng) = mid; 
    }

    ll diff = 0;
    auto itl = d.lower_bound(ok);
    if (ok <= x) {
        for (auto it = itl; ; ++it) {
            diff -= it->second * (it->first - prev(it)->first);
            if (it == itr) break;
        }
    }

    {
        auto pit = prev(itl);
        if (pit->second > y && y > itr->second && pit->first < x && x < itr->first) {
            diff += y * (x - pit->first);
            diff += itr->second * (itr->first - x);

            d.erase(itl, itr);
            d[x] = y;
        } else {
            return 0;
        }
    }

    assert(diff >= 0);
    return diff;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    map<ll, ll> d1, d2, d3, d4;
    d1[0] = 1e9;
    d1[1e9] = 0;
    d2[0] = 1e9;
    d2[1e9] = 0;
    d3[0] = 1e9;
    d3[1e9] = 0;
    d4[0] = 1e9;
    d4[1e9] = 0;

    for (int i = 0; i < n; i++) {
        ll xa, ya, xb, yb;
        cin >> xa >> ya >> xb >> yb;

        xa = abs(xa);
        ya = abs(ya);

        ll ans = 0;
        ans += solve(xa, ya, d1);
        ans += solve(xb, ya, d2);
        ans += solve(xa, yb, d3);
        ans += solve(xb, yb, d4);
        cout << ans << newl;
    }

    return 0;
}