// UUID: 479697b1-da01-46bb-a663-4bea98b05720
#include <bits/stdc++.h>
using namespace std;

vector<int> par;
int find(int X){
	if(par[X]==X) return X;
	return find(par[X]);
}

void onion(int A, int B){
	int pA=find(A), pB=find(B);
	if(pA==pB) return;
	par[pB]=pA;
}

int main() {
	int n; cin >> n;
	map<int, vector<array<int, 2>>> rowentries, colentries;
	vector<array<int, 2>> nodes(n); for(int i=0;i<n;i++){
		int x, y; cin >> x >> y;
		nodes[i]={x, y};
		rowentries[y].push_back({x, i});
		colentries[x].push_back({y, i});
	}
	vector<array<int, 3>> edges;
	for(auto [y, a] : rowentries){
		sort(a.begin(), a.end());
		for(int i=1;i<a.size();i++){
			edges.push_back({a[i][0]-a[i-1][0], a[i][1], a[i-1][1]});
		}
	}
	for(auto [x, a] : colentries){
		sort(a.begin(), a.end());
		for(int i=1;i<a.size();i++){
			edges.push_back({a[i][0]-a[i-1][0], a[i][1], a[i-1][1]});
		}
	}
	sort(edges.begin(), edges.end());
	par.resize(n);
	iota(par.begin(), par.end(), 0);
	int _max=0, maxCnt=0;
	for(auto [c, a, b] : edges){
		if(find(a)!=find(b)){
			onion(a, b);
			if(_max!=c){
				_max=c;
				maxCnt=0;
			}
			maxCnt++;
		}
	}
	cout << _max << '\n' << maxCnt;
}