#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int Mod = 1e9 + 7;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 100;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN], inv[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const ld pi = acos(-1);
inline void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
inline void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

const ld eps = 1e-10;
struct line{
	ll k, b;
	line(ll _k = 0, ll _b = 0){ k = _k, b = _b; }
	ld gety(ld x){ return k * x + b; }
};
bool cmp(line lh, line rh){ return (lh.k != rh.k) ? (lh.k < rh.k) : (lh.b < rh.b); }
inline ll cross(line lh, line rh){ return 1ll * lh.k * rh.b - 1ll * rh.k * lh.b; }
inline line operator - (line lh, line rh){ return line(lh.k - rh.k, lh.b - rh.b); }
inline ld inter(line lh, line rh){
	return (ld)(lh.b - rh.b) / (rh.k - lh.k);
}

struct {
	int n;
	line l[1000100];
	void calc(){
		static int h[1000100], hp = 0;
		hp = 0;
		sort(l, l + n, cmp);
		rep(i, n){
			while((hp && l[h[hp-1]].k == l[i].k && l[h[hp-1]].b <= l[i].b) || (hp > 1 && cross(l[h[hp-1]] - l[h[hp-2]], l[i] - l[h[hp-2]]) >= 0))
				--hp;
			h[hp++] = i;
			//rep(j, hp) cout << l[h[j]].k << "x + " << l[h[j]].b << "\n";
			//cout << "-------\n";
		}
		rep(i, hp) l[i] = l[h[i]];
		n = hp;
		//rep(i, n) cout << l[i].k << "x + " << l[i].b << "\n";
	}
	ld gety(ld x){ return l[n].gety(x); }
} ds[4];

int n;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	rep(tp, 4) ds[tp].n = n;
	rep(i, n){
		int x, y, vx, vy;
		cin >> x >> y >> vx >> vy;
		ds[0].l[i] = line(vx, x);
		ds[1].l[i] = line(-vx, -x);
		ds[2].l[i] = line(vy, y);
		ds[3].l[i] = line(-vy, -y);
	}

	rep(tp, 4){
		//cout << "-----------" << tp << "----------\n";
		ds[tp].calc();
	}

	vector< pair<ld, int> > ps;
	ps.push_back(make_pair(0, -1));
	rep(tp, 4) rep(i, ds[tp].n - 1) ps.push_back(make_pair(inter(ds[tp].l[i], ds[tp].l[i+1]), tp));
	sort(ps.begin(), ps.end());
	rep(tp, 4) ds[tp].n = 0;
	ld ans = 1e100;
	for(auto pp : ps){
		ld t = pp.first; int tp = pp.second;
		//cout << t << "  " << tp << "\n";
		if(tp >= 0) ++ds[tp].n;
		if(t > -eps){
			ld cur = (ds[0].gety(t) + ds[1].gety(t)) * (ds[2].gety(t) + ds[3].gety(t));
			if(cur < ans) ans = cur;
		}
	}

	cout << fixed << setprecision(12);
	cout << ans << "\n";

	return 0;
}