#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll INF = LLONG_MAX;

int M;
vi c, d;

pair<ll,ll> f(ll y){
    ll le = 1, ri = INF;
    rep(i, M){
        ll mc = y - c[i];
        if(d[i] == 0){
            if(c[i] > y){
                ri = -INF;
                le = INF;
                break;
            }
        } else if(d[i] > 0){
            smin(ri, mc / d[i]);
        } else{
            smax(le, mc / d[i] + ((mc%d[i])!=0));
        }
    }
    return mp(le, ri);
}

int main(){
    int N;
    cin >> N;
    vi a(N), b(N);
    rep(i, N)scanf("%d%d", &a[i], &b[i]);

    rep(i, N)rep(j, N){
        c.push_back(a[i] - a[j]);
        d.push_back(b[i] - b[j]);
    }

    M = N*N;
    ll lo = -1, hi = INF / 3;
    while(hi - lo > 1){
        ll mid = (hi + lo) / 2;
        ll le, ri;
        tie(le, ri) = f(mid);
        if(le <= ri)hi = mid;
        else lo = mid;
    }
    
    cout << f(hi).first << endl;
}