Distant Galaxy

 

 

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>
#include <map>
#include <string>
#include <climits> 
#include <set>
#include <string> 
#include <sstream>
#include <utility>
#include <ctime>
//#pragma comment(linker, "/STACK:1024000000,1024000000") 

using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::getline;
using std::make_pair;
using std::greater; 

const int MAXN(110);
const int INFI((INT_MAX-1) >> 1);

struct NODE
{
	int x, y;
	friend bool operator < (const NODE &op1, const NODE &op2)
	{
		return op1.x < op2.x;
	}
};

NODE node[MAXN];

int arr_y[MAXN];
int left[MAXN], on[MAXN], on2[MAXN];

int main()
{
	int n;
	int n_case(0);
	while(scanf("%d", &n), n)
	{
		for(int i = 1; i <= n; ++i)
		{
			scanf("%d%d", &node[i].x, &node[i].y);
			arr_y[i] = node[i].y;
		}
		sort(node+1, node+1+n);
		sort(arr_y+1, arr_y+1+n);
		int ind1 = 1;
		for(int i = 2; i <= n; ++i)
			if(arr_y[i] != arr_y[i-1])
				arr_y[++ind1] = arr_y[i];
		int ind2 = 1;
		for(int i = 2; i <= n; ++i)
			if(node[i].x != node[i-1].x)
				++ind2;
		if(ind1 <= 2 || ind2 <= 2)
		{
			printf("Case %d: %d\n", ++n_case, n);
			continue;
		}
		int ans = 0;
		for(int i = 1; i <= ind1; ++i)
			for(int j = i+1; j <= ind1; ++j)
			{
				ind2 = 0;
				for(int k = 1; k <= n; ++k)
				{
					if(ind2 == 0 || node[k].x != node[k-1].x)
					{
						++ind2;
						on[ind2] = 0;
						on2[ind2] = 0;
						left[ind2] = left[ind2-1]+on2[ind2-1]-on[ind2-1];
					}
					if(node[k].y > arr_y[i] && node[k].y < arr_y[j])
						++on[ind2];
					if(node[k].y >= arr_y[i] && node[k].y <= arr_y[j])
						++on2[ind2];
				}
				int mx = -INFI;
				for(int k = 1; k <= ind2; ++k)
				{
					ans = max(ans, mx+left[k]+on2[k]);
					mx = max(mx, on[k]-left[k]);
				}
			}
		printf("Case %d: %d\n", ++n_case, ans);
	}
	return 0;
}