rt，想给他卡过（）

#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define IO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(a,b,c) for(register int i=a;i<=b;i++)
#define rep1(a,b,c) for(register int i=a;i>=b;i-=c)

using namespace std;
const int E=1e6+5;
ll n,max1;
inline ll read(){
    ll num=0,flag=1;char c=' ';
    for(;c>'9'||c<'0';c=getchar()) if(c=='-') flag = -1;
    for(;c>='0'&&c<='9';num=(num<<1)+(num<<3)+c-48,c=getchar());
    return num*flag;
}
struct wjh{
	ll x,y;
}arr[50005];
inline bool cmp(wjh a,wjh b){
	return a.x<b.x;
}
int main(){
	n=read();
	rep(1,n,1)arr[i].x=read(),arr[i].y=read();
	sort(arr+1,arr+1+n,cmp);
	rep(1,n,1){
		for(int j=i+1;j<=n;j++){
			ll x=llabs(arr[i].y-arr[j].y);
			if((arr[j].x-arr[i].x)+x>max1)max1=(arr[j].x-arr[i].x)+x;
		}
	}
	printf("%lld",max1);
	return 0;
}

P5098