#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 2000000000
int n;
vector<long long> a,b;

long long get(long long x){
	long long M = 0,m = 1000000000000000005;
	rep(i,n){
		M = max(M,a[i]+b[i]*x);
		m = min(m,a[i]+b[i]*x);
	}
	return M-m;
}

int main(){	
	
	cin>>n;
	a.resize(n),b.resize(n);
	rep(i,n)cin>>a[i]>>b[i];
	
	long long l = 1,r = 1000000005;
	while(r-l>3){
		long long m0 = l + (r-l)/3;
		long long m1 = m0 + (r-l)/3;
		if(get(m0)<=get(m1))r = m1;
		else l = m0;
	}
	long long ans = 100000000000000000;
	long long x;
	for(long long i=l;i<=r;i++){
		if(ans > get(i)){
			x =i;
			ans = get(i);
		}
	}
	
	cout<<x<<endl;
	
	return 0;
	
}