IOC

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
struct cb{
    int x,y,z,X,Y,Z;
    void is(cb&r){x=max(x,r.x),X=min(X,r.X),y=max(y,r.y),Y=min(Y,r.Y),z=max(z,r.z),Z=min(Z,r.Z);}
    int ar(){
        if(x>=X||y>=Y||z>=Z)return 0;
        return (X-x)*(Y-y)*(Z-z);
    }
    void gt(){scanf("%d%d%d%d%d%d",&x,&y,&z,&X,&Y,&Z);}
}A[1024],X;
int main(void){
    IN(_)F(_){
        IN(N)F(N)A[i].gt();
        X=*A;
        F(N)X.is(A[i]);
        printf("Case %d: %d\n",i+1,X.ar());
    }
    return 0;
}