#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

// Yay!!
#define endl codeforces

// macros for iterator
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

// alias
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

// variadic min/max
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }

// variadic chmin/chmax
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

// multi demension array
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
// fill container
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { if constexpr (std::is_invocable<F, Args...>::value) { t = f(args...); } else { for (ssize_t i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); } }
#endif

// make multi dimension vector
template <typename T> vec<T> make_v(ssize_t sz) { return vec<T>(sz); }
template <typename T, typename... Tail> auto make_v(ssize_t hs, Tail&&... ts) { auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); return vec<decltype(v)>(hs, v); }

// init
namespace init__ { 
struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; 
}



int main() {
    using square = std::tuple<ll, ll, ll, ll>;
    const ll inf = 5e15;

    ll n;
    std::cin >> n;
    vec<square> sv(n);
    for (auto &&e : sv) {
        ll a, b, c, d;
        std::cin >> a >> b >> c >> d;
        e = square(a, b, c, d);
    }

    std::set<pll> st[4];
    for (ll i = 0; i < 4; i++) {
        st[i].emplace(inf, 0);  // x, y
        st[i].emplace(0, inf);
    }
 
    for (auto e : sv) {
        auto [ xa, ya, xb, yb ] = e;
        pll rngs[] = { pll(xb, yb), pll(-xa, yb), pll(-xa, -ya), pll(xb, -ya) };
        ll ans = 0;
        for (ll i = 0; i < 4; i++) {
            auto [ x, y ] = rngs[i];
            auto ite = st[i].lower_bound(pll(x, y));
            if (y <= ite->second) continue;
            vec<pll> rp;
            bool update = false;
            while (true) {
                auto pite = std::prev(ite);
                ll lx = x - pite->first;
                ll ly = std::min(pite->second, y) - ite->second;
                ans += lx * ly;
                if (lx * ly) update = true;
                if (pite->second <= y) rp.push_back(*pite);
                if (y <= pite->second) break;
                ite = pite;
            }
            for (auto &&e : rp) st[i].erase(e);
            if (update) st[i].emplace(x, y);
        }
        std::cout << ans << "\n";
    }

    return 0;
}