#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N=303;
int used[N],tim;
char s[4][50];
set<int>st[4][4][4][4],A,B,C,E,F,G;
vector<int>v[4];
int read()
{
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
	return x*f;
}
void getS(char *p)
{
	char c=getchar();int i=0;
	while(c!='[')c=getchar();
	c=getchar();
	while(c!=']')p[i++]=c,c=getchar();
	p[i]='\0';
}
int main()
{
 
	int t=read();
	for(int ca=1;ca<=t;ca++)
	{
		memset(used,0,sizeof(used)),tim=0;
		for(int a=1;a<=3;a++)
		for(int b=1;b<=3;b++)
		for(int c=1;c<=3;c++)
		for(int d=1;d<=3;d++)
		set<int>().swap(st[a][b][c][d]);
 
		int n=read();
		for(int i=1;i<=n;i++)
		{
			getS(s[0]),getS(s[1]),getS(s[2]),getS(s[3]);
			vector<int>().swap(v[0]),vector<int>().swap(v[1]);
			vector<int>().swap(v[2]),vector<int>().swap(v[3]);
 
			if(strcmp(s[0],"*")==0)v[0].pb(1),v[0].pb(2),v[0].pb(3);
			else if(strcmp(s[0],"one")==0)v[0].pb(1);
			else if(strcmp(s[0],"two")==0)v[0].pb(2);
			else if(strcmp(s[0],"three")==0)v[0].pb(3);
 
			if(strcmp(s[1],"*")==0)v[1].pb(1),v[1].pb(2),v[1].pb(3);
			else if(strcmp(s[1],"diamond")==0)v[1].pb(1);
			else if(strcmp(s[1],"squiggle")==0)v[1].pb(2);
			else if(strcmp(s[1],"oval")==0)v[1].pb(3);
 
			if(strcmp(s[2],"*")==0)v[2].pb(1),v[2].pb(2),v[2].pb(3);
			else if(strcmp(s[2],"solid")==0)v[2].pb(1);
			else if(strcmp(s[2],"striped")==0)v[2].pb(2);
			else if(strcmp(s[2],"open")==0)v[2].pb(3);
 
			if(strcmp(s[3],"*")==0)v[3].pb(1),v[3].pb(2),v[3].pb(3);
			else if(strcmp(s[3],"red")==0)v[3].pb(1);
			else if(strcmp(s[3],"green")==0)v[3].pb(2);
			else if(strcmp(s[3],"purple")==0)v[3].pb(3);
 
			for(int a:v[0])for(int b:v[1])
			for(int c:v[2])for(int d:v[3])
			st[a][b][c][d].insert(i);
		}
		printf("Case #%d: ",ca);
		int f=0;
		for(int a=1;a<=3&&!f;a++)
		for(int b=1;b<=3&&!f;b++)
		for(int c=1;c<=3&&!f;c++)
		for(int d=1;d<=3&&!f;d++)
		{
			if(st[a][b][c][d].empty())continue;
			if(st[a][b][c][d].size()>=3)
			{
				int cnt=0;
				for(int x:st[a][b][c][d])
				{
					printf("%d ",x),cnt++;
					if(cnt==3)break;
				}
				puts(""),f=1;
			}
			else
			{
				for(int p=1;p<=3&&!f;p++)
				for(int q=1;q<=3&&!f;q++)
				for(int g=1;g<=3&&!f;g++)
				for(int h=1;h<=3&&!f;h++)
				{
					if(st[p][q][g][h].empty())continue;
					int t1,t2,t3,t4;
					if(p==a)t1=a;else t1=6-a-p;
					if(b==q)t2=b;else t2=6-b-q;
					if(c==g)t3=c;else t3=6-c-g;
					if(d==h)t4=d;else t4=6-d-h;
 
					if(st[t1][t2][t3][t4].empty())continue;
					tim++;int x=0,y=0,z=0;
					for(int k:st[a][b][c][d])if(used[k]!=tim){used[k]=tim,x=k;break;}
					for(int k:st[p][q][g][h])if(used[k]!=tim){used[k]=tim,y=k;break;}
					for(int k:st[t1][t2][t3][t4])if(used[k]!=tim){used[k]=tim,z=k;break;}
					if(x&&y&&z)printf("%d %d %d\n",x,y,z),f=1;
				}
			}
		}
		if(!f)puts("-1");
	}
	return 0;
}

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N=1e5+10;
ll read()
{
	ll x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
	return x*f;
}
int a[N],b[N],num[N*2],tot,father[N*2],sz[N*2],e[N*2];
int find(int x){return x==father[x]?x:father[x]=find(father[x]);}
int main()
{
	int t=read();
	for(int ca=1;ca<=t;ca++)
	{
		tot=0;
		int n=read();
		for(int i=1;i<=n;i++)a[i]=read(),b[i]=read(),num[++tot]=a[i],num[++tot]=b[i];
		sort(num+1,num+1+tot);
		tot=unique(num+1,num+1+tot)-num-1;
		for(int i=1;i<=tot;i++)father[i]=i,sz[i]=1,e[i]=0;
		for(int i=1;i<=n;i++)
		{
			a[i]=lower_bound(num+1,num+1+tot,a[i])-num;
			b[i]=lower_bound(num+1,num+1+tot,b[i])-num;
			int fu=find(a[i]),fv=find(b[i]);
			if(fu!=fv){father[fu]=fv,sz[fv]+=sz[fu],e[fv]+=e[fu];}
			e[fv]++;
		}
		int res=0;
		for(int i=1;i<=tot;i++)
		if(father[i]==i)res+=(e[i]>sz[i]-1)?sz[i]:sz[i]-1;
		printf("Case #%d: %d\n",ca,res);
 
	}
	return 0;
}