#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
const int N=405+5;
const int inf=0x3f3f3f3f3f3f3f3f;
const int mod=998244353;
typedef pair<int,int> pii;
int T=1,n,now;
int a[N],ax[N],ay[N];
vector<pii>sp;
pii opt;
bool check(int x,int y)
{
    for(int i=1;i<=n;i++){
		int xx=ax[i],yy=ay[i];
		xx-=x;
		yy-=y;
		int num=((max(abs(xx),abs(yy))&1)?1:0);
		if(num!=a[i]){
			return 0;
		}
	}
	return 1;
}
void solve()
{
	now++;sp.clear();
	scanf("%lld",&n);
	for(int i=1;i<=n;i++){
		char c;
		cin>>ax[i]>>ay[i]>>c;
		if(c=='.'){
			a[i]=0;
		}
		else{
			a[i]=1;
		}
	}
	for(int i=-200;i<=200;i++){
		for(int j=-200;j<=200;j++){
			if(check(i,j)){
				sp.pb({i,j});
			}
		}
	}
	printf("Case #%lld: ",now);
	if(!sp.size()){
		puts("Too damaged");
		return;
	}
	int ans=1e18,xx=-1e18,yy=-1e18;
	for(auto tmp:sp){
		int x=tmp.fi;
		int y=tmp.se;
		ans=min(ans,abs(x)+abs(y));
	}
	for(auto tmp:sp){
		int x=tmp.fi;
		int y=tmp.se;
		if(ans==abs(x)+abs(y)){
			if(x>xx){
				opt={x,y};
				xx=x;yy=y;
			}
			else if(x==xx){
				if(y>yy){
					opt={x,y};
					yy=y;
				}
			}
		}
	}
	printf("%lld %lld\n",opt.fi,opt.se);
}
signed main()
{
//	freopen("D.in","r",stdin);
//	freopen("D.out","w",stdout);
	scanf("%lld",&T);
	while(T--){
		solve();
	}
	return 0;
}
//dyyyyds