#include <bits/stdc++.h>
#define J 0
#define S 1
#define C 2
#define M 3
#define X 4
#define B 5
using namespace std;
struct chess {
	int x, y, typ;
	vector<pair<int, int>> getneighbor() {
		vector<pair<int, int>> mv;
		if (typ == J) mv = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
		if (typ == S) mv = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
		if (typ == C) {
			for (int i = 0; i < 10; i++) if (i != x) mv.push_back({i - x, 0});
			for (int i = 0; i < 9; i++) if (i != y) mv.push_back({0, i - y});
		}
		if (typ == M) mv = {{2, 1}, {2, -1}, {-2, 1}, {-2, -1}, {1, 2}, {1, -2}, {-1, 2}, {-1, -2}};
		if (typ == X) mv = {{2, 2}, {2, -2}, {-2, 2}, {-2, -2}};
		if (typ == B) {
			if (x <= 4) mv = {{1, 0}};
			else mv = {{1, 0}, {0, 1}, {0, -1}};
		}
		vector<pair<int, int>> ret;
		for (const auto &m : mv) {
			int nx = x + m.first, ny = y + m.second;
			if (nx < 0 || ny < 0 || nx >= 10 || ny >= 9) continue;
			ret.push_back({nx, ny});
		}
		return ret;
	}
};

int dist[10][9][6][10][9];
struct node {
	vector<chess> st; int dep; int isvalid; pair<int, int> strat;
	void chk() {
		bool tag = 1; int m = st.size(); for (int i = 1; i < m; i++) tag &= st[i].typ == st[0].typ;
		if (tag) isvalid = st[0].typ; else isvalid = -1;
	}
	
};

vector<node> move(const node &n, int qx, int qy) {
	map<int, node> ans;
	for (auto &x : n.st) {
		int dis = dist[x.x][x.y][x.typ][qx][qy];
		ans[dis].st.push_back(x);
	}
	vector<node> ref;
	for (auto &p : ans) p.second.dep = n.dep - 1, ref.push_back(p.second);
	return ref;
}

node move2(const node &n, int qx, int qy, int scan) {
	map<int, node> ans;
	for (auto &x : n.st) {
		int dis = dist[x.x][x.y][x.typ][qx][qy];
		ans[dis].st.push_back(x);
	}
	return ans[scan];
}

void search(node &rt) {
	// printf(" -- serch : %d\n", rt.dep);
	// for (auto &f : rt.st) printf("%d %d %d\n", f.x, f.y, f.typ);
	// puts("--");
	rt.chk(); if (~rt.isvalid) return rt.strat = {-1, -1}, void();
	if (rt.dep == 0) return;
	for (int i = 0; i < 10; i++) for (int j = 0; j < 9; j++) {
	// for (int i = 3; i <= 3; i++) for (int j = 6; j <= 6; j++) {
		auto nxt = move(rt, i, j); bool tag = 1;
		for (auto &s : nxt) search(s), tag &= bool(~s.isvalid);
		if (tag) return rt.isvalid = 10, rt.strat = {i, j}, void();
	}
}

int main() {
	for (int sx = 0; sx < 10; sx++) for (int sy = 0; sy < 9; sy++) for (int t = 0; t < 6; t++) {
		auto D = dist[sx][sy][t];
		chess st{sx, sy, t}; queue<chess> q;
		memset(D, -1, sizeof dist[0][0][0]);
		q.push(st); D[sx][sy] = 0;
		while (q.empty() == 0) {
			auto u = q.front(); q.pop(); auto vvc = u.getneighbor();
			for (auto &v : vvc) if (D[v.first][v.second] == -1) {
				D[v.first][v.second] = D[u.x][u.y] + 1; q.push({v.first, v.second, u.typ});
			}
		}
	}
	// for (int t = 0; t < 6; t++) printf("%d\n", dist[9][0][t][3][6]);
	int n; scanf("%d", &n); node RT, root;
	while (n--) {
		int x, y; scanf("%d %d", &x, &y);
		for (int i = 0; i < 6; i++) RT.st.push_back({x, y, i});
	}
	bool outputstep = 1;
	while (1) {
		for (int Step = 1; ; Step++) {
			root = RT; root.dep = Step;
			search(root);
			if (~root.isvalid) {
				if (outputstep) printf("%d\n", Step);
				outputstep = 0;
				break;
			}
		}
		printf("? %d %d\n", root.strat.first, root.strat.second); fflush(stdout);
		int scan; scanf("%d", &scan);
		RT = move2(RT, root.strat.first, root.strat.second, scan);
		RT.chk(); if (~RT.isvalid) {
			if (RT.isvalid == 0) puts("! J");
			if (RT.isvalid == 1) puts("! S");
			if (RT.isvalid == 2) puts("! C");
			if (RT.isvalid == 3) puts("! M");
			if (RT.isvalid == 4) puts("! X");
			if (RT.isvalid == 5) puts("! B");
			return 0;
		}
	}
}