#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;

const int MAXN = 1020;
ll a[MAXN], b[MAXN];
int N;

ll get(ll x) {
    ll ret = 0;
    for (int i = 0; i < N; i++) {
        for (int j = i+1; j < N; j++) {
            ret = max(ret, abs((b[i]-b[j]) * x + (a[i]-a[j])));
        }
    }
    return ret;
}

int main() {
    cin >> N;
    for (int i = 0; i < N; i++) {
        scanf("%lld %lld", a+i, b+i);
    }
    ll low = 1, high = 1e9+7;
    while (high-low > 2) {
        ll m1 = (high+low*2) / 3;
        ll m2 = (high*2+low) / 3;
        if (get(m1) <= get(m2)) high = m2;
        else low = m1;
    }
    if (get(low) <= get(high-1)) cout << low << endl;
    else cout << high-1 << endl;
    return 0;
}