#include <bits/stdc++.h>
using namespace std;
#define ll long long

#ifndef ONLINE_JUDGE
#define imie(x) cerr << #x << " = " << x << '\n';
#else
#define imie(x)
#endif

void debug(vector<int> v) {
    cerr << "[";
    int n = (int)v.size();
    for(int i = 0; i < n; i++) {
        cerr << v[i] << (i == n-1 ? "" : ", ");
    }
    cerr << "]" << '\n';
}


void setIO() {
#ifndef ONLINE_JUDGE
 freopen("input.txt", "r", stdin);freopen("Error.txt", "w", stderr);
 freopen("output.txt", "w", stdout);
#endif
 std::ios_base::sync_with_stdio(false);
 std::cin.tie(NULL);
}


void test_case() {
	int n; cin >> n;
	vector< pair<int, int> > p(n), x(n), y(n);
	for(int i = 0; i < n; i++) {
		cin >> x[i].first >> y[i].first;
		x[i].second = i;
		y[i].second = i;
		p[i] = make_pair(x[i].first, y[i].first);
	}
	set<int> use;
	sort(x.begin(), x.end());
	use.insert(x[0].second);
    use.insert(x[1].second);
    use.insert(x[n-2].second);
    use.insert(x[n-1].second);
    sort(y.begin(), y.end());
    use.insert(y[0].second);
    use.insert(y[1].second);
    use.insert(y[n-2].second);
    use.insert(y[n-1].second);
    vector<int> dist;
    for(int a : use) {
    	for(int b : use) {
    		if(a >= b) continue;
    		dist.push_back(max(abs(p[a].first - p[b].first), abs(p[a].second - p[b].second)));
    	}
    }
    sort(dist.begin(), dist.end(), greater<>());
    cout << dist[1] << '\n';

}

int main() {
	setIO();
	int T;
	T = 1;
	while(T-- >0) {
		test_case();
	}
}





#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}

int main(){
    ll n;cin>>n;
    vector<PP> x(n),y(n);
    vp v(n);
    rep(i,n){
        ll a,b;cin>>a>>b;
        x[i]=PP(a,b,i);
        y[i]=PP(b,a,i);
        v[i]=P(a,b);
    }
    auto dis=[&](ll i,ll j){
        return PP(max(abs(v[i].fi-v[j].fi),abs(v[i].se-v[j].se)),min(i,j),max(i,j));
    };
    sort(all(x));sort(all(y));
    vector<PP> al;
    al.pb(dis(get<2>(x[0]),get<2>(x[n-1])));
    al.pb(dis(get<2>(x[0]),get<2>(x[n-2])));
    al.pb(dis(get<2>(x[1]),get<2>(x[n-1])));
    al.pb(dis(get<2>(y[0]),get<2>(y[n-1])));
    al.pb(dis(get<2>(y[0]),get<2>(y[n-2])));
    al.pb(dis(get<2>(y[1]),get<2>(y[n-1])));
    dupli(al);
    reverse(all(al));
    out(get<0>(al[1]));
}