#include <bits/stdc++.h>

using namespace std;

namespace {

    typedef long double real;
    typedef long long ll;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        auto i = vs.begin();
        os << "[" << *i;
        for (++i; i != vs.end(); ++i) os << " " << *i;
        return os << "]";
    }
    template<class T> istream& operator>>(istream& is, vector<T>& vs) {
        for (auto it = vs.begin(); it != vs.end(); it++) is >> *it;
        return is;
    }

    const ll INF = LLONG_MAX / 2LL;

    int N;
    vector<ll> A, B;
    void input() {
        cin >> N;
        A.resize(N);
        B.resize(N);
        for (int i = 0; i < N; i++) {
            cin >> A[i] >> B[i];
        }
    }

    ll C(ll x) {
        ll m = INF;
        ll M = 0; 
        for (int i = 0; i < N; i++) {
            m = min(m, A[i] + B[i] * x);
            M = max(M, A[i] + B[i] * x);
        }
        //cout << x << " -> " << M - m << endl;
        return M - m;
    }

    void solve() {
        if (N == 1) {
            cout << 1 << endl;
            return;
        }

        ll len = C(1);
        ll t = 1;
        for (int i = 0; i < N; i++) {
            for (int j = i + 1; j < N; j++) {
                if (B[i] == B[j]) continue;
                ll x = - (A[i] - A[j]) / real(B[i] - B[j]);
                if (x <= 0) continue;
                ll y = floor(x);
                for (ll dy = -2; dy <= 2; dy++) {
                    if (y + dy <= 0) continue;
                    ll p = C(y + dy);
                    if (len > p) {
                        len = p;
                        t = y + dy;
                    } else if (len == p) {
                        t = min(t, y + dy);
                    }
                }
            }
        }
        cout << t << endl;
    }
}

int main() {
    input(); solve();
    return 0;
}