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

#ifdef SG
	#include <debug.h>
#else
	template<typename T> struct outputer;
	struct outputable {};
	#define PRINT(...)
	#define OUTPUT(...)
	#define show(...)
	#define debug(...)
	#define deepen(...)
	#define timer(...)
	#define fbegin(...)
	#define fend
	#define pbegin(...)
	#define pend
#endif

#define ARG4(_1,_2,_3,_4,...) _4

#define forn3(i,l,r) for (int i = int(l); i < int(r); ++i)
#define forn2(i,n) forn3 (i, 0, n)
#define forn(...) ARG4(__VA_ARGS__, forn3, forn2) (__VA_ARGS__)

#define ford3(i,l,r) for (int i = int(r) - 1; i >= int(l); --i)
#define ford2(i,n) ford3 (i, 0, n)
#define ford(...) ARG4(__VA_ARGS__, ford3, ford2) (__VA_ARGS__)

#define ve vector
#define pa pair
#define tu tuple
#define mp make_pair
#define mt make_tuple
#define pb emplace_back
#define fs first
#define sc second
#define all(a) (a).begin(), (a).end()
#define sz(a) ((int)(a).size())

typedef long double ld;
typedef int64_t ll;
typedef uint64_t ull;
typedef uint32_t ui;
typedef uint16_t us;
typedef uint8_t uc;
typedef pa<int, int> pii;
typedef pa<int, ll> pil;
typedef pa<ll, int> pli;
typedef pa<ll, ll> pll;
typedef ve<int> vi;

template<typename T> inline auto sqr (T x) -> decltype(x * x) {return x * x;}
template<typename T1, typename T2> inline bool umx (T1& a, T2 b) {if (a < b) {a = b; return 1;} return 0;}
template<typename T1, typename T2> inline bool umn (T1& a, T2 b) {if (b < a) {a = b; return 1;} return 0;}

const int N = 200000;
const int X = 1000000000;

struct Input {
	int n;
	int x[N], y[N];
	
	bool read () {
		if (!(cin >> n)) {
			return 0;
		}
		forn (i, n) {
			scanf("%d%d", &x[i], &y[i]);
		}
		return 1;
	}

	void init (const Input &input) {
		*this = input;
	}
};

struct Data: Input {
	ll ans;
	
	void write () {
		cout << ans << endl;
	}
};


namespace Main {
	
	struct Solution: Data {
	
		void solve_ () {
			set<pii> xs;
			set<pii> ys;
			
			forn (i, n) {
				xs.insert(mp(x[i], i));
				ys.insert(mp(y[i], i));
			}
			
			while (1) {
				int mnx = xs.begin()->fs;
				int mxx = xs.rbegin()->fs;
				int mny = ys.begin()->fs;
				int mxy = ys.rbegin()->fs;
				umn(ans, ll(mxx - mnx) * ll(mxy - mny));
			
				int num = ys.begin()->sc;
				
				debug(mt(xs, ys, mnx, mxx, mny, mxy, num, x[num], y[num]));
				
				if (x[num] > y[num]) {
					xs.erase(mp(x[num], num));
					ys.erase(mp(y[num], num));
					swap(x[num], y[num]);
					xs.insert(mp(x[num], num));
					ys.insert(mp(y[num], num));
				} else {
					break;
				}
			}
		}
	
		void solve_xy (int i1, int i2) {
			forn (i, n) {
				if (i == i1) {
				} else if (i == i2) {
				} else {
				}
			}
			
			solve_();
		}
	
		void solve_xx (int i1, int i2) {
			forn (i, n) {
				if (i == i1) {
				} else if (i == i2) {
					swap(x[i], y[i]);
				} else {
					swap(x[i], y[i]);
				}
			}
			
			solve_();
		}
		
		void solve () {
			forn (i, n) {
				if (x[i] > y[i]) {
					swap(x[i], y[i]);
				}
			}
			
			int mnx = 0, mxy = 0;
			forn (i, n) {
				if (x[mnx] > x[i]) {
					mnx = i;
				}
				if (y[mxy] < y[i]) {
					mxy = i;
				}
			}
			ans = ll(X) * ll(X);
			solve_xy(mnx, mxy);
			
			forn (i, n) {
				if (x[i] > y[i]) {
					swap(x[i], y[i]);
				}
			}
			
			if (mnx != mxy) {
				solve_xx(mnx, mxy);
			}
		}
		
		void clear () {
			*this = Solution();
		}
	};
}


Main::Solution sol;

int main () {
	cout.setf(ios::showpoint | ios::fixed);
	cout.precision(20);

	#ifdef SG
		freopen((problemname + ".in").c_str(), "r", stdin);
//		freopen((problemname + ".out").c_str(), "w", stdout);
		while (sol.read()) {
			sol.solve();
			sol.write();
			sol.clear();
		}
	#else
		sol.read();
		sol.solve();
		sol.write();
	#endif
	
	/*
	int t;
	cin >> t;
	forn (i, t) {
		sol.read();
		sol.solve();
		sol.write();
		sol.clear();
	}
	*/
	
	return 0;
}


Measured memory_bytes: 20608