#include<cstdio>

#include<cmath>

#include<vector>

#include<map>

#include<set>

#include<algorithm>

#include<cstring>

using namespace std;

//#define local

const int maxn = ;

int Red;

int X[maxn],szx;

int Y[maxn],szy;

int G[maxn][maxn];

int sumb[maxn][maxn];

int suma[maxn][maxn];

struct Poi

{

    int x,y;

    int tp;

    int sx,sy;

    bool operator < (const Poi & rhs) const {

        return x < rhs.x || (x == rhs.x && y < rhs.y);

    }

    void input(){

        scanf("%d%d%d",&x,&y,&tp);

        if(!tp)Red++;

    }

    void GetDis(){

        sx = lower_bound(X,X+szx,x)-X;

        sy = lower_bound(Y,Y+szy,y)-Y;

        G[sx][sy] = tp;

    }

}P[maxn];

const int INF = 0x7fffffff;

int main()

{

#ifdef local

    freopen("in.txt","r",stdin);

    //freopen("out.txt","w",stdout);

#endif // local

    int N;

    int cas = ;

    while(~scanf("%d",&N)&&N){

        Red = ;

        memset(G,-,sizeof(G));

        int minx = INF, miny = INF;

        for(int i =  ; i < N; i++){

            P[i].input();

            minx = min(minx,P[i].x);

            miny = min(miny,P[i].y);

            //Y[i] = P[i].y;

        }

        X[] = minx-; Y[] = miny- ;

        for(int i = ; i <= N; i++) {

            X[i] = P[i-].x;

            Y[i] = P[i-].y;

        }

        sort(X,X+N+);

        sort(Y,Y+N+);

        szy = unique(Y,Y+N+) - Y;

        szx = unique(X,X+N+) - X;

        memset(suma,,sizeof(suma));

        memset(sumb,,sizeof(sumb));

        for(int i = ; i < N; i++) P[i].GetDis();

        for(int i = ; i < szx; i++)

        for(int j = ; j < szy; j++){

            suma[i][j] = suma[i-][j]+suma[i][j-]-suma[i-][j-]+(G[i][j]==);

            sumb[i][j] = sumb[i-][j]+sumb[i][j-]-sumb[i-][j-]+(G[i][j]==);

        }

        Red >>= ;

        int area = INF;

        for(int lx = ; lx < szx; lx++){

            for(int rx = lx+; rx < szx; rx++){

                for(int ly = ; ly <szy; ly++){

                    for(int ry = ly+; ry < szy; ry++){

                        if(suma[rx][ry]-suma[rx][ly]-suma[lx][ry]+suma[lx][ly]) continue;

                        if(Red == sumb[rx][ry]-sumb[rx][ly]-sumb[lx][ry]+sumb[lx][ly]){

                                area = min(area,(X[rx]-X[lx+])*(Y[ry]-Y[ly+]));

                        }

                    }

                }

            }

        }

        printf("Case %d: %d\n",++cas,area!=INF?area:-);

    }

    return ;

}