#include <cstdio>
#include <limits>
#include <algorithm>

typedef long long ll;

const ll MAX = std::numeric_limits<ll>::max();

int N;
int A[1000], B[1000];
ll lb = 1, ub = 1001001001;

ll f(ll x){
    ll mn = MAX, mx = -MAX;
    
    for(int i=0;i<N;i++){
        ll y = x * B[i] + A[i];
        mn = std::min(mn, y);
        mx = std::max(mx, y);
    }

    return mx - mn;
}

int main(){
    scanf("%d", &N);

    for(int i=0;i<N;i++){
        scanf("%d %d", A+i, B+i);
    }

    while(ub - lb > 2){
        ll a = (1ll * ub + 2ll * lb) / 3, b = (2ll * ub + 1ll * lb) / 3;

        if(f(a) <= f(b)){ub = b;}
        else{lb = a;}
    }

    ll res = lb;
    for(ll i=lb+1;i<ub;i++){
        if(f(res) > f(i)){res = i;}
    }

    printf("%lld\n", res);
}