#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll cnt=0;
vector<ll> p;
vector<ll> siz;
ll maxw=0;
ll ans=0;
struct node{
    ll a;
    ll b;
    ll w;

};

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++;
        if (siz[a]>siz[b]){
            siz[a]++;
            p[b]=a;
            return;
        }
        siz[b]++;
        p[a]=b;
    }
}
vector<node> g;
bool r(node a, node b){
return (a.w<b.w) ;
}

int main()
{
    int n;
    cin>>n;
    p.resize(n+1,-1);
    siz.resize(n+1,1);
    map<ll,vector<pair<ll,ll>>> xk;
    map<ll,vector<pair<ll,ll>>> yk;

    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_back({i,a.second,abs(y-a.first)});
        }
        for (pair<int,int> a:yk[y]){
            if (i!=a.second)  g.push_back({i,a.second,abs(x-a.first)});
        }

    }
    sort(g.begin(),g.end(), r);
    ll i=0;
    while (cnt<n-1 && i<g.size()){
        unio(g[i].a,g[i].b,g[i].w);
        i++;
    }
    cout<<maxw<<"\n";
    cout<<ans;
}