#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll cnt=0;
vector<ll> p(100001,-1);
ll maxw=0;
ll ans=0;


ll holvan(ll a){
    if (p[a]==-1) return a;
    return p[a]=holvan(p[a]);
}
void unio(ll a,ll b, ll w){
    a=holvan(a);
    b=holvan(b);
    if (a!=b){
        cnt++;
        if (w>maxw){
            maxw=w;
            ans=0;
        }
        if (w==maxw) ans++;
        p[b]=a;
    }
}

int main()
{
    int n;
    cin>>n;
    map<ll,vector<pair<ll,ll>>> xk;
    map<ll,vector<pair<ll,ll>>> yk;
    priority_queue<pair<int,pair<int,int>>,vector<pair<int,pair<int,int>>>,greater<pair<int,pair<int,int>>>> g;
    for (int i=0; i<n;i++){
        ll x,y;
        cin>>x>>y;
        yk[y].push_back({x,i});
        xk[x].push_back({y,i});
        for (pair<int,int> a:xk[x]){
            if (i!=a.second) g.push({abs(y-a.first),{i,a.second}});
        }
        for (pair<int,int> a:yk[y]){
            if (i!=a.second)  g.push({abs(x-a.first),{i,a.second}});
        }

    }
    ll i=0;
    while (cnt<n-1 && !g.empty()){
        pair<int,pair<int,int>> v=g.top();
        g.pop();
        unio(v.second.first,v.second.second,v.first);
        i++;
    }
    cout<<maxw<<"\n";
    cout<<ans;
}