#include <bits/stdc++.h>
using namespace std;
vector<int> p, r;
struct edge
{
    int l, r, val;
};
bool comp(edge a, edge b)
{
    return a.val < b.val;
}
int get(int n)
{
    return p[n] == 0 ? n : p[n] = get(p[n]);
}
void unio(int a, int b)
{
    a = get(a);
    b = get(b);
    if(a != b)
    {
        if(r[b] > r[a]) swap(a, b);
        p[b] = a;
        if(r[b] == r[a]) r[a]++;
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    p.resize(n + 1);
    r.resize(n + 1);
    map<int, vector<pair<int, int> > > x, y;
    for(int i = 1; i <= n; i++)
    {
        int a, b;
        cin >> a >> b;
        x[a].push_back({b, i});
        y[b].push_back({a, i});
    }
    vector<edge> e;
    for(auto a : x)
    {
        vector<pair<int, int> > v = a.second;
        sort(v.begin(), v.end());
        for(int i = 0; i < v.size() - 1; i++)
        {
            edge b = {v[i].second, v[i + 1].second, v[i + 1].first - v[i].first};
            e.push_back(b);
        }
    }
    for(auto a : y)
    {
        vector<pair<int, int> > v = a.second;
        sort(v.begin(), v.end());
        for(int i = 0; i < v.size() - 1; i++)
        {
            edge b = {v[i].second, v[i + 1].second, v[i + 1].first - v[i].first};
            e.push_back(b);
        }
    }
    sort(e.begin(), e.end(), comp);
    int maxi = 0, maxp = 0;
    int k = n;
    for(auto a : e)
    {
        if(a.val > maxi)
        {
            maxp = 0;
            maxi = a.val;
        }
        if(get(a.l) != get(a.r))
        {
            unio(a.l, a.r);
            maxp++;
            k--;
            if(k == 1)
            {
                break;
            }
        }
    }
    cout << maxi << "\n" << maxp;
}