#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<double> Complex;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
    for (int i = 0; i < sz(v); i++) {
        os << v[i];
        if (i < sz(v) - 1) os << " ";
    }
    return os;
}

const int geta = 20000;
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> v1(40400), v2(40400);
    int xa, ya, xb, yb;
    int ans;
    for (int i = 0; i < n; i++) {
        ans = 0;
        cin >> xa >> ya >> xb >> yb;
        xa += geta;
        xb += geta;
        ya = -ya;
        for (int j = xa; j < geta; j++) {
            if (yb <= v1[j]) break;
            ans += yb - v1[j];
            v1[j] = yb;
        }
        for (int j = xb - 1; j >= geta; j--) {
            if (yb <= v1[j]) break;
            ans += yb - v1[j];
            v1[j] = yb;
        }
        for (int j = xa; j < geta; j++) {
            if (ya <= v2[j]) break;
            ans += ya - v2[j];
            v2[j] = ya;
        }
        for (int j = xb - 1; j >= geta; j--) {
            if (ya <= v2[j]) break;
            ans += ya - v2[j];
            v2[j] = ya;
        }
        cout << ans << '\n';
    }
}