#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;

ld presek(pair<int,int> &a,pair<int,int> &b){
	if(a.s==b.s)return -1;
	return (ld)(a.f-b.f)/(b.s-a.s);
}
vector<pair<ld,pair<int,int>>> hull(vector<pair<int,int>> a,bool mn){
	sort(all(a));
	if(!mn)reverse(all(a));
	vector<pair<int,int>> hul;
	hul.pb(a[0]);
	for(int i=1;i<sz(a);i++){
		if(presek(a[i],hul.back())<=0)continue;
		while(sz(hul)>1&&presek(a[i],hul.back())<=presek(a[i],hul[sz(hul)-2])){
			hul.pop_back();
		}
		hul.pb(a[i]);
	}
	vector<pair<ld,pair<int,int>>> ans;
	ans.pb({0,hul[0]});
	for(int i=1;i<sz(hul);i++){
		ans.pb({presek(hul[i],hul[i-1]),hul[i]});
	}
	ans.pb({LLONG_MAX,{-1,-1}});
	reverse(all(ans));
	return ans;
} 
int main()
{
	int n;
	scanf("%i",&n);
	vector<pair<int,int>> x,y;
	vector<vector<pair<ld,pair<int,int>>>> ord;
	for(int i=0;i<n;i++){
		int xx,yy,vx,vy;
		scanf("%i %i %i %i",&xx,&yy,&vx,&vy);
		x.pb({xx,vx});
		y.pb({yy,vy});
	}
	sort(all(x));
	sort(all(y));
	ord={hull(x,0),hull(x,1),hull(y,0),hull(y,1)};
	
	ld ans=LLONG_MAX;
	vector<pair<int,int>> pt(4);
	vector<ld> pos(4);
	while(1){
		ld mn=LLONG_MAX;
		for(int i=0;i<4;i++){
			auto it=ord[i].back();
			mn=min(mn,it.f);
		}
		if(mn>LONG_MAX/2)break;
		for(int i=0;i<4;i++){
			auto it=ord[i].back();
			if(it.f==mn){
				ord[i].pop_back();
				pt[i]=it.s;
			}
			pos[i]=pt[i].f+mn*pt[i].s;
		}
		ans=min(ans,(ld)(pos[1]-pos[0])*(pos[3]-pos[2]));
	}
	printf("%.10Lf\n",ans);
	return 0;
}