#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;

struct point{
    int x,y,ind;
};

int n;
vector <point> v;
vector <pair <int,pair <int,int>>> e;
map <int,int> m;

bool srt(point a,point b){
    return (a.x+a.y<b.x+b.y);
}

int dist(int i,int j){
    int a=abs((v[i].x+v[i].y)-(v[j].x+v[j].y));
    int b=abs((v[i].x-v[i].y)-(v[j].x-v[j].y));
    return max(a,b);
}

void get_edges(){
    sort(v.begin(),v.end(),srt);
    m.clear();
    for (int i=0;i<n;i++){
        auto it=m.lower_bound(v[i].x-v[i].y);
        while(it!=m.end()){
            int j=(*it).second;
            if (v[j].x>v[i].x) break;
            it=m.erase(it);
            pair <int,pair<int,int>>p;
            p.first=dist(i,j);
            p.second.first=min(v[i].ind,v[j].ind);
            p.second.second=max(v[i].ind,v[j].ind);
            e.push_back(p);
        }
        m[v[i].x-v[i].y]=i;
    }
}

void geometry(){
    get_edges();
    for (int i=0;i<n;i++) v[i].y*=-1;
    get_edges();
    for (int i=0;i<n;i++) swap(v[i].x,v[i].y);
    get_edges();
    for (int i=0;i<n;i++) v[i].y*=-1;
    get_edges();
}

//------------------------------

int cnt;
vector <int> par(1e5,0);
vector <int> sz(1e5,1);

int holvan(int a){
    return (a==par[a]?a:par[a]=holvan(par[a]));
}

void unio(int a,int b){
    a=holvan(a);
    b=holvan(b);
    if (a==b) return;
    if (sz[a]>sz[b]) swap(a,b);
    par[a]=b;
    sz[b]+=sz[a];
    cnt--;
}

int spanning_tree(){
    cnt=n;
    for (int i=0;i<n;i++) par[i]=i;
    sort(e.begin(),e.end());
    int a,b,w;
    for (auto p : e){
        a=p.second.first;
        b=p.second.second;
        w=p.first;
        unio(a,b);
        if (cnt==1) return w;
    }
    return -1;
}

//------------------------------

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    v.resize(n);
    for (int i=0;i<n;i++){
        cin >> v[i].x >> v[i].y;
        v[i].ind=i;
    }
    geometry();
    cout << spanning_tree();
}