#include <cstdio>
#include <algorithm>

using namespace std;

const int MAXN = 1E5 + 10;

int n;
int x[MAXN], y[MAXN];

bool check(int h){
	int a[6] = {x[0] + h, x[0] - h, y[0] + h, y[0] - h, x[0] + y[0] + h, x[0] + y[0] - h};
	for (int i = 0; i < n; ++i){
		a[0] = min(a[0], x[i] + h);
		a[1] = max(a[1], x[i] - h);
		a[2] = min(a[2], y[i] + h);
		a[3] = max(a[3], y[i] - h);
		a[4] = min(a[4], x[i] + y[i] + h);
		a[5] = max(a[5], x[i] + y[i] - h);
	}
	return a[0] >= a[1] && a[2] >= a[3] && a[4] >= a[5] && max(a[1] + a[3], a[5]) <= min(a[0] + a[2], a[4]);
}

int main(){
	int cas;
	scanf("%d", &cas);
	for (int casi = 1; casi <= cas; ++casi){
		printf("Case %d: ", casi);
		scanf("%d", &n);
		for (int i = 0; i < n; ++i)
			scanf("%d%d", &x[i], &y[i]);
		int low = 0, high = 3E4, mid;
		while (low < high){
			mid = low + high >> 1;
			if (check(mid))
				high = mid;
			else
				low = mid + 1;
		}
		printf("%d\n", low * (low + 1) * 3 + 1);
	}
	return 0;
}