#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S min_L(S a,T b){
  return a<=b?a:b;
}
template<class S, class T> inline S max_L(S a,T b){
  return a>=b?a:b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
template<class S, class T> inline S chmax(S &a, T b){
  if(a<b){
    a=b;
  }
  return a;
}
int N;
long long X[200000];
long long Y[200000];
long long arr[200000];
int main(){
  int k;
  long long res = 0;
  rd(N);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(X[Lj4PdHRW]);
      rd(Y[Lj4PdHRW]);
    }
  }
  for(k=(0);k<(2);k++){
    int i;
    for(i=(0);i<(N);i++){
      if(k==0){
        for(i=(0);i<(N);i++){
          arr[i] = X[i] + Y[i];
        }
      }
      if(k==1){
        for(i=(0);i<(N);i++){
          arr[i] = X[i] - Y[i];
        }
      }
      {
        int ao_dF3pO;
        long long tU__gIr_;
        if(N==0){
          tU__gIr_ = 0;
        }
        else{
          tU__gIr_ = arr[0];
          for(ao_dF3pO=(1);ao_dF3pO<(N);ao_dF3pO++){
            tU__gIr_ = min_L(tU__gIr_, arr[ao_dF3pO]);
          }
        }
        {
          int V9aVTaxx;
          long long APIVbQlN;
          if(N==0){
            APIVbQlN = 0;
          }
          else{
            APIVbQlN = arr[0];
            for(V9aVTaxx=(1);V9aVTaxx<(N);V9aVTaxx++){
              APIVbQlN = max_L(APIVbQlN, arr[V9aVTaxx]);
            }
          }
          chmax(res, APIVbQlN-tU__gIr_);
        }
      }
    }
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200913-1

// --- original code ---
// int N; ll X[2d5], Y[2d5];
// ll arr[2d5];
// {
//   ll res = 0;
//   rd(N,(X,Y)(N));
//   rep(k,2) rep(i,N){
//     if(k==0) rep(i,N) arr[i] = X[i] + Y[i];
//     if(k==1) rep(i,N) arr[i] = X[i] - Y[i];
//     res >?= max(arr(N)) - min(arr(N));
//   }
//   wt(res);
// }


Measured memory_bytes: 9308