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

ll f(ll x){
	if(x<1)return 1e15;
	ll mx = a[0]+b[0]*x;;
	ll mn = a[0]+b[0]*x;;
	for(ll i = 0; i<n;i++){
		mx = max(mx,a[i]+b[i]*x);
		mn = min(mn,a[i]+b[i]*x);
	}
	return mx - mn;
}


void solve(){
	P ans(f(1),1);
	for(ll i = 0;i<n;i++){
		for(ll j = i+1;j<n;j++){
			//y = ai + bix
			//y = aj + bjx
			//0 = (ai-aj) + (bi-bj)x
			//x = (aj-ai)/(bi-bj)
			if(b[i]==b[j])continue;
			ll x = (a[j]-a[i])/(b[i]-b[j]);
			ans = min(ans,P(f(x),x));
			x++;
			ans = min(ans,P(f(x),x));
			x--;
			x--;
			ans = min(ans,P(f(x),x));
		}
	}
	cerr<<f(2)<<endl;
	cout<<ans.second<<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();
}