#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<double> x(n), y(n), vx(n), vy(n);
    for (int i = 0; i < n; ++i) {
        int a,b,c,d; cin >> a >> b >> c >> d;
        x[i] = a, y[i] = b, vx[i] = c, vy[i] = d;
    }

    auto fn = [&](long double t) -> long double {
        long double x_min = 1e18, x_max = -1e18;
        long double y_min = 1e18, y_max = -1e18;
        for (int i = 0; i < n; ++i) {
            x_min = min(x_min, x[i]+t*vx[i]);
            x_max = max(x_max, x[i]+t*vx[i]);
            y_min = min(y_min, y[i]+t*vy[i]);
            y_max = max(y_max, y[i]+t*vy[i]);
        }
        return (x_max - x_min) * (y_max - y_min);
    };

    long double l = 0, r = 1e10;
    long double res = fn(0);
    for (int _ = 0; _ < 200; ++_) {
        long double ml = (2 * l + r) / 3, mr = (l + 2 * r) / 3;
        long double L = fn(ml);
        long double R = fn(mr);
        res = min(res, L);
        res = min(res, R);
        if (L < R) r = mr;
        else l = ml;
    }
    res = min(res, fn((l+r)/2));
    cout << fixed << setprecision(15) << res << endl;
}