#include<bits/stdc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long long
using namespace std;
const int INF=1e8;
int n,cnt;
vector<pair<pair<int,int>,char>>pos;
map<vector<pair<pair<int,int>,char>>,int>F;
map<vector<pair<pair<int,int>,char>>,pair<int,int>>Q;
inline int query(int x,int y){
	--cnt;
	cout<<"? "<<x<<' '<<y<<endl;
	return cin>>x,x;
}
inline void answer(char c){
	while(cnt--)cout<<"? 0 0"<<endl;
	cout<<"! "<<c<<endl;
}
inline int build(vector<pair<pair<int,int>,char>>pos,int dep){
	if(F.count(pos))return F[pos];
	const auto chk=[&](){
		for(auto&i:pos)if(i.second!=pos[0].second)return 0;
		return 1;
	};
	if(chk())return F[pos]=0;
	if(dep>2)return INF;
	int z=INF;
	int dis[10][9];
	map<int,vector<pair<pair<int,int>,char>>>D[10][9];
	for(auto [s,c]:pos){
		auto [sx,sy]=s;
		for(int x=0;x<10;++x)for(int y=0;y<9;++y)dis[x][y]=INF;
		queue<pair<int,int>>que;
		dis[sx][sy]=0,que.emplace(sx,sy);
		while(!que.empty()){
			auto [x,y]=que.front();que.pop();
			const auto make=[&](int nx,int ny){
				if(nx>=0&&nx<10&&ny>=0&&ny<9&&dis[nx][ny]>dis[x][y]+1)dis[nx][ny]=dis[x][y]+1,que.emplace(nx,ny);
			};
			if(c=='J'){
				make(x+1,y),make(x-1,y),make(x,y+1),make(x,y-1);
			}
			else if(c=='S'){
				make(x+1,y+1),make(x+1,y-1),make(x-1,y+1),make(x-1,y-1);
			}
			else if(c=='C'){
				if(dis[x][y]>1)continue;
				for(int xx=0;xx<10;++xx)make(xx,y);
				for(int yy=0;yy<9;++yy)make(x,yy);
			}
			else if(c=='M'){
				make(x+2,y+1),make(x+2,y-1),make(x-2,y+1),make(x-2,y-1);
				make(x+1,y+2),make(x+1,y-2),make(x-1,y+2),make(x-1,y-2);
			}
			else if(c=='X'){
				make(x+2,y+2),make(x+2,y-2),make(x-2,y+2),make(x-2,y-2);
			}
			else{
				if(x<=4)make(x+1,y);
				else make(x+1,y),make(x,y+1),make(x,y-1);
			}
		}
		for(int x=0;x<10;++x)
			for(int y=0;y<9;++y)
				D[x][y][dis[x][y]].emplace_back(s,c);
	}
	pair<int,int>p;
	for(int r=0;r<10;++r)for(int c=0;c<9;++c){
		if(D[r][c].size()==1)continue;
		int mx=0;
		for(auto [d,e]:D[r][c]){
			mx=max(mx,build(e,dep+1)+1);
			if(mx>=z)break;
		}
		if(mx<z)z=mx,p=make_pair(r,c);
	}
	return Q[pos]=p,F[pos]=z;
}
inline void solve(vector<pair<pair<int,int>,char>>pos){
	const auto chk=[&](){
		for(auto&i:pos)if(i.second!=pos[0].second)return 0;
		return 1;
	};
	if(chk())return answer(pos[0].second);
	int dis[10][9];
	map<int,vector<pair<pair<int,int>,char>>>D[10][9];
	for(auto [s,c]:pos){
		auto [sx,sy]=s;
		for(int x=0;x<10;++x)for(int y=0;y<9;++y)dis[x][y]=INF;
		queue<pair<int,int>>que;
		dis[sx][sy]=0,que.emplace(sx,sy);
		while(!que.empty()){
			auto [x,y]=que.front();que.pop();
			const auto make=[&](int nx,int ny){
				if(nx>=0&&nx<10&&ny>=0&&ny<9&&dis[nx][ny]>dis[x][y]+1)dis[nx][ny]=dis[x][y]+1,que.emplace(nx,ny);
			};
			if(c=='J'){
				make(x+1,y),make(x-1,y),make(x,y+1),make(x,y-1);
			}
			else if(c=='S'){
				make(x+1,y+1),make(x+1,y-1),make(x-1,y+1),make(x-1,y-1);
			}
			else if(c=='C'){
				if(dis[x][y]>1)continue;
				for(int xx=0;xx<10;++xx)make(xx,y);
				for(int yy=0;yy<9;++yy)make(x,yy);
			}
			else if(c=='M'){
				make(x+2,y+1),make(x+2,y-1),make(x-2,y+1),make(x-2,y-1);
				make(x+1,y+2),make(x+1,y-2),make(x-1,y+2),make(x-1,y-2);
			}
			else if(c=='X'){
				make(x+2,y+2),make(x+2,y-2),make(x-2,y+2),make(x-2,y-2);
			}
			else{
				if(x<=4)make(x+1,y);
				else make(x+1,y),make(x,y+1),make(x,y-1);
			}
		}
		for(int x=0;x<10;++x)
			for(int y=0;y<9;++y)
				D[x][y][dis[x][y]].emplace_back(s,c);
	}
	const auto [r,c]=Q[pos];
	const auto d=query(r,c);
	solve(D[r][c][d==-1?INF:d]);
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
	cin>>n;
	for(int i=0;i<n;++i){
		int x,y;cin>>x>>y;
		for(auto j:"JSCMXB"s)pos.emplace_back(make_pair(x,y),j);
	}
	cnt=build(pos,0);
	cout<<cnt<<'\n';
	solve(pos);
    return 0;
}
/*
*/