#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

int a[1111];
int b[1111];
int N;

long long tryit(long long x){
    long long maxv = 0;
    long long minv = 1LL<<60;
    FOR(i,N){
        long long value = a[i] + b[i] * x;
        maxv = max(maxv, value);
        minv = min(minv, value);
    }
    return maxv - minv;
}

int main()
{
    cin>>N;
    FOR(i,N){
        scanf("%d%d",&a[i],&b[i]);
    }
    long long lower = 1, upper = 2000000000;
    long long ans = 1;
    long long minv = tryit(ans);
    while(lower < upper - 2){
        long long L = (lower + lower + upper) / 3;
        long long R = (lower + upper + upper) / 3;
        long long vL = tryit(L);
        long long vR = tryit(R);
        if(minv > vL || (minv == vL && ans > L)) {
            minv = vL;
            ans = L;
        }
        if(minv > vR || (minv == vR && ans > R)) {
            minv = vR;
            ans = R;
        }
        if(vL <= vR){
            upper = R;
        }else {
            lower = L;
        }
    }
    cout<<ans<<endl;
    return 0;
}