In a far away kingdom lives a very greedy king. To defend his land, he built n guard towers. Apart from the towers the kingdom has two armies, each headed by a tyrannical and narcissistic general. The generals can't stand each other, specifically, they will never let soldiers of two armies be present in one tower.

During defence operations to manage a guard tower a general has to send part of his army to that tower. Each general asks some fee from the king for managing towers. As they live in a really far away kingdom, each general evaluates his fee in the following weird manner: he finds two remotest (the most distant) towers, where the soldiers of his army are situated and asks for the fee equal to the distance. Each tower is represented by a point on the plane with coordinates (x, y), and the distance between two points with coordinates (x1, y1) and (x2, y2) is determined in this kingdom as |x1 - x2| + |y1 - y2|.

The greedy king was not exactly satisfied with such a requirement from the generals, that's why he only agreed to pay one fee for two generals, equal to the maximum of two demanded fees. However, the king is still green with greed, and among all the ways to arrange towers between armies, he wants to find the cheapest one. Each tower should be occupied by soldiers of exactly one army.

He hired you for that. You should find the minimum amount of money that will be enough to pay the fees. And as the king is also very scrupulous, you should also count the number of arrangements that will cost the same amount of money. As their number can be quite large, it is enough for the king to know it as a remainder from dividing by 109 + 7.

Two arrangements are distinct if the sets of towers occupied by soldiers of the first general are distinct.

Input

The first line contains an integer n (2 ≤ n ≤ 5000), n is the number of guard towers. Then follow n lines, each of which contains two integers x, y — the coordinates of the i-th tower (0 ≤ x, y ≤ 5000). No two towers are present at one point.

Pretest 6 is one of the maximal tests for this problem.

Output

Print on the first line the smallest possible amount of money that will be enough to pay fees to the generals. 

Print on the second line the number of arrangements that can be carried out using the smallest possible fee. This number should be calculated modulo 1000000007 (109 + 7).

Examples

Input

2
0 0
1 1


Output

0
2


Input

4
0 0
0 1
1 0
1 1


Output

1
4


Input

3
0 0
1000 1000
5000 5000


Output

2000
2

Note

In the first example there are only two towers, the distance between which is equal to 2. If we give both towers to one general, then we well have to pay 2 units of money. If each general receives a tower to manage, to fee will be equal to 0. That is the smallest possible fee. As you can easily see, we can obtain it in two ways.
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int sx = mod, sy = mod, bx, by;
int cnt, n;
int vis[5001], cost[5001][5001], x[5001], y[5001];
bool dfs(int v, int c, int mid) {
  if (vis[v] && c != vis[v]) return 0;
  if (vis[v]) return 1;
  vis[v] = c;
  for (int i = 1; i <= n; i++)
    if (cost[v][i] > mid)
      if (!dfs(i, 3 - c, mid)) return 0;
  return 1;
}
bool check(int mid) {
  cnt = 0;
  for (int i = 1; i <= n; i++)
    if (!vis[i]) {
      if (!dfs(i, 1, mid)) return 0;
      cnt++;
    }
  return 1;
}
void out() {
  int ans = 1;
  for (int i = 1; i <= cnt; i++) ans = ans * 2 % mod;
  cout << ans << endl;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &x[i], &y[i]);
    sx = min(x[i], sx);
    sy = min(y[i], sy);
    bx = max(x[i], bx);
    by = max(y[i], by);
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      cost[i][j] = abs(x[j] - x[i]) + abs(y[j] - y[i]);
  int lb = 0, ub = bx + by - sx - sy;
  while (lb <= ub) {
    memset(vis, 0, sizeof(vis));
    int mid = (lb + ub) / 2;
    if (!check(mid))
      lb = mid + 1;
    else
      ub = mid - 1;
  }
  cout << lb << endl;
  memset(vis, 0, sizeof(vis));
  check(lb);
  out();
  return 0;
}
