#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int N;
ll a[1010], b[1010];

ll f(int x) {
    ll MIN = LLONG_MAX, MAX = LLONG_MIN;
    for (int i = 0; i < N; i++) {
        MIN = min(MIN, a[i] + b[i] * x);
        MAX = max(MAX, a[i] + b[i] * x);
    }
    return MAX - MIN;
}

bool check(int x) {
    return f(x - 1) > f(x);
}

int main() {
    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> a[i] >> b[i];
    }
    int ok = 1;
    int ng = 1e9 + 10;
    while (abs(ok - ng) > 1) {
        int mid = (ok + ng) / 2;
        if (check(mid)) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    cout << ok << endl;
}