#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int n;
int a[1001],b[1001];
char c[1001];

inline char get(int x,int y,int u,int v){
	u-=x;
	v-=y;
	return (max(abs(u),abs(v))&1)?'#':'.';
}

inline bool check(int x,int y){
	for (int i=1;i<=n;i++){
		if (get(x,y,a[i],b[i])!=c[i]){
			return false;
		}
	}
	return true;
}

int main(){
//	freopen("D.in","r",stdin);
//	freopen("D.out","w",stdout);
	int T;
	cin>>T;
	for (int test_case=1;test_case<=T;test_case++){
		cout<<"Case #"<<test_case<<": ";
		cin>>n;
		for (int i=1;i<=n;i++){
			cin>>a[i]>>b[i]>>c[i];
		}
		for (int dis=0;dis<=201;dis++){
			for (int x=dis;x>=-dis;x--){
				if (x==dis or x==-dis){
					if (check(x,0)){
						cout<<x<<" 0\n";
						goto egg;
					}
				}else{
					if (x>=0){
						if (check(x,dis-x)){
							cout<<x<<" "<<dis-x<<"\n";
							goto egg;
						}
						if (check(x,x-dis)){
							cout<<x<<" "<<x-dis<<"\n";
							goto egg;
						}
					}else{
						if (check(x,dis+x)){
							cout<<x<<" "<<dis+x<<"\n";
							goto egg;
						}
						if (check(x,-dis-x)){
							cout<<x<<" "<<-dis-x<<"\n";
							goto egg;

						}
					}
				}
			}
		}
		cout<<"Too damaged\n";
		egg:;
	}
	return 0;
}