#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

const int BIG = 1e9 + 239;

// max
vector<pair<ld, pair<int, int>>> cht(vector<pair<int, int>>& ln) {
    sort(ln.begin(), ln.end());
    vector<pair<ld, pair<int, int>>> ch;
    for (const auto& line : ln) {
        while (!ch.empty()) {
            auto lst = ch.back().second;
            if (lst.first == line.first) {
                break;
            }
            ld x = (ld)(lst.second - line.second) / (line.first - lst.first);
            if (x > ch.back().first) {
                ch.emplace_back(x, line);
                break;
            }
            ch.pop_back();
        }
        if (ch.empty()) {
            ch.emplace_back(make_pair((ld)0.0, line));
            continue;
        }
    }
    //cerr << ch.size() << "\n";
    return ch;
}

void solve() {
    int n;
    cin >> n;
    vector<pair<int, int>> x(n), y(n);

    int mnx = BIG;
    int mxx = -BIG;
    int mny = BIG;
    int mxy = -BIG;
    for (int i = 0; i < n; i++) {
        cin >> x[i].second >> y[i].second >> x[i].first >> y[i].first;
        mnx = min(mnx, x[i].second);
        mxx = max(mxx, x[i].second);
        mny = min(mny, y[i].second);
        mxy = max(mxy, y[i].second);
    }
    ld ans = ((ll)(mxx - mnx) * (ll)(mxy - mny));

    vector<pair<int, int>> xn(n), yn(n);
    for (int i = 0; i < n; i++) {
        xn[i].first = -x[i].first;
        xn[i].second = -x[i].second;
    }
    for (int i = 0; i < n; i++) {
        yn[i].first = -y[i].first;
        yn[i].second = -y[i].second;
    }

    array<vector<pair<ld, pair<int, int>>>, 4> xs;
    xs[0] = cht(x);
    xs[1] = cht(xn);
    xs[2] = cht(y);
    xs[3] = cht(yn);
    array<int, 4> pos = {0, 0, 0, 0};
    array<ld, 4> ev;
    auto func = [&](ld x) {
        for (int i = 0; i < 4; i++) {
            const auto& line = xs[i][pos[i]].second;
            ev[i] = line.first * x + line.second;
        }
        return (ev[0] + ev[1]) * (ev[2] + ev[3]);
    };
    while (true) {
        bool stop = true;
        for (int i = 0; i < 4; i++) {
            if (pos[i] + 1 < xs[i].size()) {
                stop = false;
                break;
            }
        }
        if (stop) {
            break;
        }

        ld mn;
        int best = -1;
        for (int i = 0; i < 4; i++) {
            if (pos[i] + 1 < xs[i].size()) {
                if (best == -1 || mn > xs[i][pos[i] + 1].first) {
                    best = i;
                    mn = xs[i][pos[i] + 1].first;
                }
            }
        }

        ans = min(ans, func(mn));
        pos[best]++;
    }

    cout << ans << "\n";
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cout << fixed << setprecision(20);

    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}