// UUID: fef917ba-3329-49bf-8487-32bb383f4a48
#include <bits/stdc++.h>
using namespace std;

vector<int> rep, s;

void unite(int u, int v) {
    if (s[u] < s[v]) swap(u, v);
    rep[v] = u;
    s[u] += s[v];
}

int fnd(int node) {
    if (rep[node] == node) return node;
    return rep[node] = fnd(rep[node]);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    rep.resize(n);
    s.assign(n, 1);
    vector<pair<pair<int, int>, int>> a(n);
    for (int i = 0; i < n; i++) {
        rep[i] = a[i].second = i;
        cin >> a[i].first.first >> a[i].first.second;
    }
    vector<pair<int, pair<int, int>>> edges;
    sort(a.begin(), a.end());
    for (int i = 1; i < n; i++) if (a[i].first.first == a[i - 1].first.first) edges.push_back({a[i].first.second - a[i - 1].first.second, {a[i].second, a[i - 1].second}});
    for (int i = 0; i < n; i++) swap(a[i].first.first, a[i].first.second);
    sort(a.begin(), a.end());
    for (int i = 1; i < n; i++) if (a[i].first.first == a[i - 1].first.first) edges.push_back({a[i].first.second - a[i - 1].first.second, {a[i].second, a[i - 1].second}});
    sort(edges.begin(), edges.end());
    int mx = 0, cnt = 0;
    for (int i = 0; i < edges.size(); i++) {
        int u = fnd(edges[i].second.first), v = fnd(edges[i].second.second);
        if (u == v) continue;
        if (mx < edges[i].first) {
            mx = edges[i].first;
            cnt = 0;
        }
        cnt++;
        unite(u, v);
    }
    cout << mx << "\n" << cnt;
    return 0;
}