#include <bits/stdc++.h>

int map[3][3];
char s[1005];

int main() {
	int T;
	scanf("%d", &T);
	while (T--) {
		int S;
		scanf("%o", &S);
		bool finished = true;
		for (int i = 0; i < 3; ++i) 
			for (int j = 0; j < 3; ++j) {
				int o = 3 * i + j;
				if (S >> o & 1)	
					map[i][j] = 0;
				else {
					map[i][j] = -1;
					finished = false;
				}
			}
		for (int i = 0; i < 3; ++i) 
			for (int j = 0; j < 3; ++j) {
				int o = 3 * i + j;
				if (map[i][j] == 0) {
					if (S >> o + 9 & 1)
						map[i][j] = 2;
					else 
						map[i][j] = 1;
				}
			}
		auto solve = [&]() {
			for (int i = 0; i < 3; ++i) {
				bool ok = true;
				for (int j = 1; j < 3; ++j) {
					if (map[i][0] != map[i][j]) {
						ok = false;
					}
				}
				if (ok) return map[i][0];
			}
			for (int i = 0; i < 3; ++i) {
				bool ok = true;
				for (int j = 1; j < 3; ++j) {
					if (map[0][i] != map[j][i]) {
						ok = false;
					}
				}
				if (ok) return map[i][0];
			}
			if (map[0][0] == map[1][1] && map[1][1] == map[2][2])
				return map[1][1];
			if (map[0][2] == map[1][1] && map[1][1] == map[2][0])
				return map[1][1];
			return -1;
		};
		int o = solve();
		if (o == -1) {
			if (!finished) {
				puts("In progress");
			}
			else {
				puts("Cat's");
			}
		}
		else if (o == 1) puts("O wins");
		else puts("X wins");
	}
}