#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n;cin >> n;
    vl a(n),b(n);//ax+b;
    rep(i,n)cin >> b[i] >> a[i];
    vl pl={1};
    rep(i,n){
        repl(j,i+1,n){
            if(a[i]==a[j])continue;
            ll k=b[j]-b[i];if(k==0)continue;
            k/=a[i]-a[j];
            if(k<=0)continue;
            pl.push_back(k);pl.push_back(k+1);
        }
    }
    sort(all(pl));pl.erase(unique(all(pl)),pl.end());
    ll ans=INF;
    ll k=1;
    for(auto p:pl){
        ll maxi=-1,mini=INF;
        rep(i,n){
            ll t=a[i]*p+b[i];
            chmax(maxi,t);
            chmin(mini,t);
        }
        if(chmin(ans,maxi-mini))k=p;
    }
    cout << k <<endl;
}