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

using ll = long long;

void solve() {
    auto valid = [&](int x, int y) {
        return 0 <= x && x < 10 && 0 <= y && y < 9;
    };
    auto getTo = [&](int x, int y, int ty) {
        vector<pair<int, int>> tmp;
        if(ty == 0) {
            for(int i = -1; i <= 1; i += 2) {
                tmp.push_back({x + i, y});
                tmp.push_back({x, y + i});
            }
        } else if(ty == 1) {
            for(int i = -1; i <= 1; i += 2) {
                for(int j = -1; j <= 1; j += 2) {
                    tmp.push_back({x + i, y + j});
                }
            }
        } else if(ty == 2) {
            for(int r = 0; r < 10; r++) if(r != x) tmp.push_back({r, y});
            for(int c = 0; c < 9; c++) if(c != y) tmp.push_back({x, c});
        } else if(ty == 3) {
            for(int i = -2; i <= 2; i += 4) {
                for(int j = -1; j <= 1; j += 2) {
                    tmp.push_back({x + i, y + j});
                    tmp.push_back({x + j, y + i});
                }
            }
        } else if(ty == 4) {
            for(int i = -2; i <= 2; i += 4) {
                for(int j = -2; j <= 2; j += 4) {
                    tmp.push_back({x + i, y + j});
                }
            }
        } else {
            tmp.push_back({x + 1, y});
            if(x > 4) {
                tmp.push_back({x, y + 1});
                tmp.push_back({x, y - 1});
            }
        }
        vector<pair<int, int>> res;
        for(auto [x, y] : tmp) if(valid(x, y)) res.push_back({x, y});
        return res;
    };
    vector f(10, vector(9, vector(6, vector(10, vector(9, -1)))));
    for(int i = 0; i < 10; i++) {
        for(int j = 0; j < 9; j++) {
            for(int ty = 0; ty < 6; ty++) {
                auto &g = f[i][j][ty];
                queue<pair<int, int>> q;
                q.push({i, j});
                g[i][j] = 0;
                while(q.size()) {
                    auto [x, y] = q.front(); q.pop();
                    for(auto [tx, ty] : getTo(x, y, ty)) {
                        if(g[tx][ty] == -1) {
                            g[tx][ty] = g[x][y] + 1;
                            q.push({tx, ty});
                        }
                    }
                }
            }
        }
    }
    int n;
    cin >> n;
    using V = vector<array<int, 3>>;
    V A;
    for(int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        for(int j = 0; j < 6; j++) {
            A.push_back({x, y, j});
        }
    }
    map<V, int> g[10];
    map<V, pair<int, int>> best[10];
    auto get = [&](int i, int j, V &A) {
        map<int, V> res;
        for(auto [x, y, t] : A) {
            res[f[x][y][t][i][j]].push_back({x, y, t});
        }
        return res;
    };
    auto getty = [&](V A) {
        for(auto [x, y, ty] : A) {
            if(ty != A[0][2]) return -1;
        }
        return A[0][2];
    };
    auto dfs = [&](auto self, V A, int dep) -> bool {
        if(getty(A) != -1) return 1;
        if(!dep) return 0;
        if(g[dep].count(A)) return g[dep][A];
        for(int i = 0; i < 10; i++) {
            for(int j = 0; j < 9; j++) {
                auto nxt = get(i, j, A);
                if(nxt.size() == 1) continue;
                int flg = 1;
                for(auto [k, v] : nxt) {
                    if(!self(self, v, dep - 1)) {
                        flg = 0;
                        break;
                    }
                }
                if(flg) {
                    best[dep][A] = {i, j};
                    return g[dep][A] = 1;
                }
            }
        }
        return g[dep][A] = 0;
    };
    int m;
    for(int i = 1;; i++) {
        for(int j = 0; j <= i; j++) {
            g[j].clear(), best[j].clear();
        }
        if(dfs(dfs, A, i)) {
            m = i;
            break;
        }
    }
    cout << m << endl;
    auto slv = [&](auto self, V A, int dep) {
        if(!dep) {
            cout << "! " << "JSCMXB"[A[0][2]] << endl;
            return;
        }
        auto [i, j] = best[dep][A];
        cout << "? " << i << ' ' << j << endl;
        int res;
        cin >> res;
        self(self, get(i, j, A)[res], dep - 1);
    };
    slv(slv, A, m);
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}