#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{

ll n,ans1,ans2,k,kk,p,pp;
cin>>n;
ll a[n],b[n],c[n],d[n];
for(int i=0;i<n;i++)
{
    cin>>a[i]>>b[i];
    c[i]=a[i]+b[i];
    d[i]=a[i]-b[i];
}
sort(c,c+n);
k=*max_element(c,c+n);
kk=*min_element(c,c+n);
p=*max_element(d,d+n);
pp=*min_element(d,d+n);
ans1=k-kk;
ans2=p-pp;
cout<<max(ans1,ans2)<<endl;
}
