#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

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

ll f(ll x) {
    ll maxv = 0;
    ll minv = 1e18;

    rep (i, N) {
        maxv = max(maxv, a[i] + b[i] * x);
        minv = min(minv, a[i] + b[i] * x);
    }

    return maxv - minv;
}

int main() {
    cin >> N;
    rep (i, N) cin >> a[i] >> b[i];

    ll l = 0;
    ll r = 1e9 + 7;

    while (r - l > 1) {
        ll m = (l + r) / 2;

        if (f(m + 1) - f(m) >= 0) {
            r = m;
        } else {
            l = m;
        }
    }

    cout << r << endl;
}