// UUID: 8e29c463-c787-4519-8a1d-5e3945deff6c
#include <bits/stdc++.h>
using namespace std;

struct Edge {
    int u, v;
    int w;
};

struct DSU {
    vector<int> p, r;
    DSU(int n) : p(n), r(n, 0) {
        iota(p.begin(), p.end(), 0);
    }
    int find(int x) {
        if (p[x] != x) p[x] = find(p[x]);
        return p[x];
    }
    bool unite(int a, int b) {
        a = find(a);
        b = find(b);
        if (a == b) return false;
        if (r[a] < r[b]) swap(a, b);
        p[b] = a;
        if (r[a] == r[b]) r[a]++;
        return true;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;

    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++)cin >> x[i] >> y[i];

    vector<Edge> e;
    unordered_map<int, vector<pair<int,int>>> byX;
    byX.reserve(n * 2);
    for (int i = 0; i < n; i++) {
        byX[x[i]].push_back({y[i], i});
    }
    for (auto &kv : byX) {
        auto &v = kv.second;
        sort(v.begin(), v.end());
        for (int i = 1; i < (int)v.size(); i++) {
            e.push_back({
                v[i-1].second,
                v[i].second,
                v[i].first - v[i-1].first
            });
        }
    }

    unordered_map<int, vector<pair<int,int>>> byY;
    byY.reserve(n * 2);
    for (int i = 0; i < n; i++) {
        byY[y[i]].push_back({x[i], i});
    }
    for (auto &kv : byY) {
        auto &v = kv.second;
        sort(v.begin(), v.end());
        for (int i = 1; i < (int)v.size(); i++) {
            e.push_back({
                v[i-1].second,
                v[i].second,
                v[i].first - v[i-1].first
            });
        }
    }

    sort(e.begin(), e.end(),
         [](const Edge &a, const Edge &b) {
             return a.w < b.w;
         });

    DSU dsu(n);
    int T = 0;
    int K = 0;
    int used = 0;

    for (auto &e : e) {
        if (dsu.unite(e.u, e.v)) {
            used++;
            if (e.w > T) {
                T = e.w;
                K = 1;
            } else if (e.w == T) {
                K++;
            }
            if (used == n - 1) break;
        }
    }

    cout << T << "\n" << K << "\n";
    return 0;
}