#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <sstream>

using namespace std;

long long N;
vector<long long> a, b;

long double f(long long X){
    long long mx=0, mi=2e18;
    for (int i=0; i<N; i++){
        mx = max(mx, a[i]+X*b[i]);
        mi = min(mi, a[i]+X*b[i]);
    }

    return mx-mi;
}

int main(){

    cin >> N;
    a.resize(N); b.resize(N);
    for (int i=0; i<N; i++) cin >> a[i] >> b[i];

    long long l=1, r=1e9, cl, cr;
    while (r-l > 2){
        cl = (l*2+r)/3; cr = (l+r*2)/3;
        if (f(cl) > f(cr)) l = cl;
        else r = cr;
    }

    long long mi=2e18, ans;
    for (long long i=l; i<=r; i++){
        if (mi > f(i)){
            ans = i;
            mi = f(i);
        }
    }

    cout << ans << endl;

    return 0;
}