#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));
using namespace std;
typedef unsigned long long ull;
typedef long long ll;


struct RectangleArea {
    map<ll, ll> data;
    ll sum;
    RectangleArea():sum(0) {
        data[0] = INF;
        data[INF] = 0;
    }

    void add_point(ll x, ll y) {
        auto itr = data.lower_bound(x);
        if (itr->second >= y) return;
        ll mn_y = itr->second;
        itr = prev(itr);
        while (itr->second <= y) {
            auto pre = *itr;
            itr = prev(data.erase(itr));
            sum -= (pre.first - itr->first) * (pre.second - mn_y);
        }
        sum += (x - itr->first) * (y - mn_y);
        data[x] = y;
    }
    ll get() {
        return sum;
    }
};
int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */
    ll n; scanf("%lld", &n);
    RectangleArea ur, ul, dr, dl;
    ll pre = 0;
    ll cur = 0;
    for (int i = 0; i < n; i++) {
        ll xa, ya, xb, yb; scanf("%lld %lld %lld %lld", &xa, &ya, &xb, &yb);
        ur.add_point(xb, yb);
        ul.add_point(-xa, yb);
        dr.add_point(xb, -ya);
        dl.add_point(-xa, -ya);
        cur = ur.get() + ul.get() + dr.get() + dl.get();
        printf("%lld\n", cur - pre);
        pre = cur;
    }
    return 0;
}