#include<bits/stdc++.h>
using std::cin, std::cout;
const int N = 200005;
using db = long double;
struct p2 {
	db x, y; int id;
	db abs() const {
		return sqrt(x * x + y * y);
	}
};
p2 operator + (p2 x, p2 y) { return {x.x + y.x, x.y + y.y}; }
p2 operator - (p2 x, p2 y) { return {x.x - y.x, x.y - y.y}; }
p2 operator * (p2 x, db y) { return {x.x * y, x.y * y}; }
p2 r90(p2 x) { return {-x.y, x.x}; }
db operator * (const p2 & x, const p2 & y) { return x.x * y.y - x.y * y.x; }
db operator % (const p2 & x, const p2 & y) { return x.x * y.x + x.y * y.y; }
db cross(p2 x, p2 y, p2 z) {
	return (y - x) * (z - x);
}
std::vector<p2> gethull(std::vector<p2> o) {
	sort(o.begin(), o.end(), [](p2 x, p2 y) {
		return x.x == y.x ? x.y < y.y : x.x < y.x; 
	});
	std::vector<p2> stack;
	for(p2 x : o) {
		for(;stack.size() >= 2 && cross(stack.rbegin()[1], stack.back(), x) <= 0.5;) {
			stack.pop_back();
		}
		stack.push_back(x);
	}
	for(int i = o.size() - 2, t = stack.size();i >= 0;--i) {
		for(;stack.size() > t && cross(stack.rbegin()[1], stack.back(), o[i]) <= 0.5;) {
			stack.pop_back();
		}
		stack.push_back(o[i]);
	}
	stack.pop_back();
	return stack;
}
int findmin(auto cmp, std::vector<p2> & a) {
	int l = 0, r = a.size() - 1, d = 1;
	if(cmp(a.back(), a[0])) std::swap(l, r), d = -1;
	for(;(r - l) * d > 1;) {
		int mid = (l + r) >> 1;
		if(cmp(a[mid], a[mid - d]) && cmp(a[mid], a[l])) {
			l = mid;
		} else {
			r = mid;
		}
	}
	return l;
} 
int n;
p2 a[N];
int use[N];
db res[N];
db ans = 1e18;
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	for(int i = 1;i <= n;++i) {
		int x, y; cin >> x >> y;
		a[i] = {x, y, i};
	}
	std::vector<p2> x(a + 1, a + n + 1), y;
	x = gethull(x);
	for(auto w : x) {
		use[w.id] = 1;
	}
	for(int i = 1;i <= n;++i) if(!use[i]) {
		y.push_back(a[i]);
	}
	if(y.size()) y = gethull(y);
	std::vector<p2> prob;
	for(int i = 0;i < (int) x.size();++i) {
		prob.push_back(r90(x[(i + 1) % x.size()] - x[i]));
		prob.push_back(r90(x[(i + 2) % x.size()] - x[i]));
	}
	for(int i = 0;i < (int) y.size();++i) {
		prob.push_back(r90(y[(i + 1) % y.size()] - y[i]));
	}
	if(y.size()) {
		for(int i = 0;i < (int) x.size();++i) {
			p2 o = x[i];
			int u;
			u = findmin([&](p2 x, p2 y) { return cross(o, x, y) > 0; }, y);
			prob.push_back(r90(y[u] - o));
			u = findmin([&](p2 x, p2 y) { return cross(o, x, y) < 0; }, y);
			prob.push_back(r90(y[u] - o));
		}
	}
	for(auto v : prob) if(v.abs() > 0.5) {
		v = v * (1 / v.abs());

		std::vector<int> id;
		auto ins = [&](auto cmp, std::vector<p2> & x) {
			if(x.size()) {
				int u = findmin(cmp, x);
				id.push_back(x[u].id);
				id.push_back(x[(u + 1) % x.size()].id);
				id.push_back(x[(u + x.size() - 1) % x.size()].id);
			}
		};
		ins([&](p2 x, p2 y) { return x % v < y % v; }, x);
		ins([&](p2 x, p2 y) { return x % v > y % v; }, x);
		ins([&](p2 x, p2 y) { return x % v < y % v; }, y);
		ins([&](p2 x, p2 y) { return x % v > y % v; }, y);
		sort(id.begin(), id.end());
		id.erase(unique(id.begin(), id.end()), id.end());

		db max = a[id[0]] % v;
		db min = a[id[0]] % v;
		for(int x : id) {
			max = std::max(max, a[x] % v);
			min = std::min(min, a[x] % v);
		}
		ans = std::min(ans, max - min);
		for(int i = 0;i < (int) id.size();++i) {
			int x = id[i];
			if(a[x] % v == max || a[x] % v == min) {
				db min = 1e18, max = -1e18;
				for(int x : id) if(x != id[i]) {
					max = std::max(max, a[x] % v);
					min = std::min(min, a[x] % v);
				}
				ans = std::min(ans, max - min);
			}
		}
	}
	printf("%.10Lf\n", ans);
}