#include using namespace std; #define rep(i,n) for(ll i=0;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,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={0,-1,0,1,1,1,-1,-1,0}; const ll dx[9]={-1,0,1,0,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } int main(){ ll n;cin >> n; vl x(n),y(n); rep(i,n)cin >> x[i] >> y[i]; rep(i,n){ ll c=x[i],d=y[i]; x[i]=c+d;y[i]=c-d; } ll xmin=INF,ymin=INF,xmax=-INF,ymax=-INF; rep(i,n){ chmin(xmin,x[i]); chmin(ymin,y[i]); chmax(xmax,x[i]); chmax(ymax,y[i]); } ll ans=INF; { ll ok=INF,ng=-1; while(ok-ng>1){ ll mid=(ok+ng)>>1; bool f=true; rep(i,n){ if(x[i]<=xmin+mid*2&&y[i]<=ymin+mid*2)continue; if(x[i]>=xmax-mid*2&&y[i]>=ymax-mid*2)continue; f=false; } if(f)ok=mid; else ng=mid; } chmin(ans,ok); } { ll ok=INF,ng=-1; while(ok-ng>1){ ll mid=(ok+ng)>>1; bool f=true; rep(i,n){ if(x[i]<=xmin+mid*2&&y[i]>=ymax-mid*2)continue; if(x[i]>=xmax-mid*2&&y[i]<=ymin+mid*2)continue; f=false; } if(f)ok=mid; else ng=mid; } chmin(ans,ok); } cout << ans << endl; }