#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
ll n;
vector<ll> a,b;

ll f(ll m){
	ll l = 0, r = m;
	ll mn,mx;
	mn = mx = a[0] + b[0] * m;
	for(int i = 0;i<n;i++){
		mn = min(mn,a[i] + b[i] * m);
		mx = max(mn,a[i] + b[i] * m);
	}
	return mx - mn;
}

void solve(){
	ll l = 0,r = INT_MAX;
	while(r-l>1){
		ll m = (r+l)/2;
		if(f(m)<=f(m+1))r = m;
		else l = m;
	}
	for(ll i = 1;i<10;i++)cerr<<i<<':'<<f(i)<<endl;
	cerr<<l<<' '<<r<<endl;
	cerr<<f(l)<<' '<<f(r)<<endl;
	cout<<r<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n;
	a = b = vector<ll>(n);
	for(int i = 0;i<n;i++)cin >> a[i] >> b[i];
	solve();
}