#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
using dbl = long double;

dbl magic(dbl H, dbl W, dbl h, dbl w){
	dbl a = h / (W - w) / w, b = W * h / (W - w);

	auto f = [&](dbl t){
		return -a * t * t * t / 3 + b * t - t * (-a * t * t + b);
	};

	return f(w) - (b - H > 0 ? f(sqrtl((b - H) / a)) : 0);
}

int main() {
	cin.tie(nullptr)->sync_with_stdio(false);

	auto solve = [&]() {
		dbl H, W, h, w;
		int n; cin >> n;
		vector<pair<int, int>> p(n);
		int mxx = -1e9, mnx = 1e9, mxy = -1e9, mny = 1e9;
		for (auto& [x, y] : p) {
			cin >> x >> y;
			mxx = max(mxx, x);
			mnx = min(mnx, x);
			mxy = max(mxy, y);
			mny = min(mny, y);
		}
		if (n == 4){
			cout << (mxx - mnx) * (mxy - mny) << '\n';
			return;
		}
		set<pair<int, int>> s;
		for (auto x : {mnx, mxx})
			for (auto y : {mny, mxy})
				s.insert(make_pair(x, y));
		for (auto pp : p)
			if (s.find(pp) != s.end())
				s.erase(pp);
		pair<int, int> missing = *s.begin();
		pair<int, int> center;
		for (auto& [x, y] : p){
			if (x != mxx && x != mnx && y != mxy && y != mny){
				center = {x, y};
			}
		}

		W = mxx - mnx, H = mxy - mny;

		w = W - abs(missing.first - center.first), h = H - abs(missing.second - center.second);

		dbl ans = w * h + magic(H, W, h, w) + magic(W, H, w, h);

		cout << fixed << setprecision(20) << ans << '\n';
	};

	solve();

	return 0;
}