#include <bits/stdc++.h>

using namespace std;
 
#define ll long long
#define endl "\n"
#define pll pair<ll,ll>
#define fs first
#define sc second

ll find_set(ll v, vector<ll> &parent) 
{
    if (v == parent[v]) return v;
    return parent[v] = find_set(parent[v], parent);
}

bool union_set(ll a, ll b, vector<ll> &parent)
{
    a = find_set(a, parent);
    b = find_set(b, parent);
    if (a == b) return false;
    parent[b] = a;
    return true;
}

void solve()
{
    ll n;
    cin >> n;

    vector<ll> parent(n);
    for(ll i = 0; i < n; i++) parent[i] = i;

    map<ll,vector<pll>> h, v;

    for(ll i = 0; i < n; i++)
    {
        ll a, b;
        cin >> a >> b;
        h[a].push_back({b, i}),
        v[b].push_back({a, i});
    }

    for(auto &i : h)
    {
        sort(i.sc.begin(), i.sc.end());
    }
    for(auto &i : v)
    {
        sort(i.sc.begin(), i.sc.end());
    }

    vector<pair<ll, pll>> g;

    for(auto &i : h)
    {
        for(ll j = 0; j < i.sc.size()-1; j++)
        {
            g.push_back({i.sc[j+1].fs-i.sc[j].fs, {i.sc[j+1].sc, i.sc[j].sc}});
            //cout << i.sc[j+1].fs-i.sc[j].fs << " " << i.sc[j+1].sc << " " << i.sc[j].sc << endl;
        }
    }
    for(auto &i : v)
    {
        for(ll j = 0; j < i.sc.size()-1; j++)
        {
            g.push_back({i.sc[j+1].fs-i.sc[j].fs, {i.sc[j+1].sc, i.sc[j].sc}});
            //cout << i.sc[j+1].fs-i.sc[j].fs << " " << i.sc[j+1].sc << " " << i.sc[j].sc << endl;
        }
    }
    
    ll ans = 0;
    ll ans2 = 1;

    sort(g.begin(), g.end());

    for(ll i = 0; i < g.size(); i++)
    {
        if(union_set(g[i].sc.fs, g[i].sc.sc, parent)) 
        {
            if(ans == g[i].fs) ans2++;
            else ans2 = 1;
            ans = g[i].fs;
        }
    }

    cout << ans << endl << ans2 << endl;
}
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}