#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=100+5,M=300+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n;
int dis[N][6][N];
vector<pii> way[6];
string sim="JSCMXB";
const int limx=9,limy=8;
int getid(int x,int y){return x*9+y;}
void make(int x,int y,int o){
	int v=getid(x,y);
	dis[v][o][v]=0;
	queue<pii> q;q.emplace(x,y);
	while(!q.empty()){
		auto [x,y]=q.front();q.pop();
		int u=getid(x,y);
		for(auto [dx,dy]:way[o]){
			if(o==5&&!dx&&x<=4) continue;
			dx+=x;dy+=y;
			if(dx<0||dx>limx||dy<0||dy>limy) continue;
			int z=getid(dx,dy);
			if(dis[v][o][z]>dis[v][o][u]+1) dis[v][o][z]=dis[v][o][u]+1,q.emplace(dx,dy);
		}
	}
}
using info=vector<tuple<int,int,int> >;
map<info,int> f[N];
map<info,pii> dp[N];
int dfs(info A,int d){
	int flag=0;
	for(auto [x,y,z]:A) if(z^get<2>(A[0])) flag=1;
	if(!flag) return 1;
	if(!d) return 0;
	if(f[d].count(A)) return f[d][A];
	for(int x=0;x<=limx;x++) for(int y=0;y<=limy;y++){
		map<int,info> g;
		for(auto [a,b,z]:A) g[dis[getid(a,b)][z][getid(x,y)]].emplace_back(a,b,z);
		int flag=0;
		for(auto [a,b]:g) if(!dfs(b,d-1)){flag=1;break;}
		if(!flag) return dp[d][A]=make_pair(x,y),f[d][A]=1;
	}
	return f[d][A]=0;
}
void query(info A,int d){
	gdb(A.size());
	if(!d){
		gdb(get<2>(A[0]));
		cout<<"! "<<sim[get<2>(A[0])]<<endl;
		return;
	}
	int x=dp[d][A].fi,y=dp[d][A].se;
	cout<<"? "<<x<<' '<<y<<endl;
	int w;cin>>w;
	if(w==-1) w=dis[91][0][0];
	map<int,info> g;
	for(auto [a,b,z]:A) g[dis[getid(a,b)][z][getid(x,y)]].emplace_back(a,b,z)/*,gdb(a,b,z,dis[getid(a,b)][z][getid(x,y)])*/;
	query(g[w],d-1);
}
void Solve(){
	way[0]={{1,0},{-1,0},{0,1},{0,-1}};
	way[1]={{1,1},{1,-1},{-1,1},{-1,-1}};
	for(int i=1;i<=9;i++){
		way[2].emplace_back(i,0);
		way[2].emplace_back(-i,0);
		way[2].emplace_back(0,i);
		way[2].emplace_back(0,-i);
	}
	way[3]={{1,2},{2,1},{-1,2},{-2,1},{1,-2},{2,-1},{-1,-2},{-2,-1}};
	way[4]={{2,2},{2,-2},{-2,-2},{-2,2}};
	way[5]={{1,0},{0,1},{0,-1}};
	Me(dis,0x3f);
	for(int i=0;i<=limx;i++) for(int j=0;j<=limy;j++) for(int o=0;o<6;o++) make(i,j,o);
	cin>>n;
	info A;
	for(int i=0;i<n;i++){
		int x,y;cin>>x>>y;
		for(int o=0;o<6;o++) A.emplace_back(x,y,o);
	}
	int len=0;
	for(int i=1;;i++){
		for(int j=0;j<=i;j++) f[j].clear(),dp[j].clear();
		if(dfs(A,i)){
			len=i;break;
		}
	}
	cout<<len<<endl;
	// gdb(len);
	query(A,len);
}
int main(){
	// freopen("1.in","r",stdin);freopen("1.out","w",stdout);
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}