#include <bits/stdc++.h>
using namespace std;
#define mpr make_pair
#define pb push_back
#define fi first
#define se second
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});
                        }
                    }
                }
            }
        }
    }
    string ans = "JSCMXB";
    int n;
    cin >> n;
    vector<array<int, 3>> A;
    vector<pair<int, int>> ve;
    ve.push_back({0, 4}), ve.push_back({5, 4}), ve.push_back({8, 4}), ve.push_back({2, 4});
    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});
        }
    }
    using T = unordered_map<int, vector<array<int, 3>>>;
    auto get = [&](int i, int j, const vector<array<int, 3>> &A) {
        T res;
        for (auto [x, y, ty] : A) {
            res[f[x][y][ty][i][j]].push_back({x, y, ty});
        }
        return res;
    };
    auto evalv = [&](const vector<array<int, 3>> &v) -> pair<int, int> {
        int sz = v.size();
        set<int> tys;
        for (auto [x, y, ty] : v) tys.insert(ty);
        return {(int)tys.size(), sz};
    };
    auto eval = [&](const T &mp) -> pair<int, int> {
        if (mp.size() == 0) return {1e9, 1e9};
        pair<int, int> mx = {-1, -1};
        for (auto [k, v] : mp) {
            mx = max(mx, evalv(v));
        }
        return mx;
    };
    int m = 0;
    auto calc_m_and_beststra = [&](vector<array<int, 3>> A) {
        assert(A.size());
        m = 0;
        int lim = 10000;
        vector<pair<pair<int, int>, vector<array<int, 3>>>> states = {mpr(mpr(-1, -1), A)};
        vector<pair<pair<int, int>, pair<pair<int, int>, vector<array<int, 3>>>>> new_states;
        while (1) {
            m++;
            new_states.clear();
            for (auto [pos, AA] : states) {
                T mp;
                for (int i = 0; i < 10; i++) {
                    for (int j = 0; j < 9; j++) {
                        mp = get(i, j, AA);
                        vector<array<int, 3>> BB;
                        pair<int, int> val = {-1, -1};
                        for (auto [k, v] : mp) {
                            if (evalv(v) > val) {
                                val = evalv(v);
                                BB = v;
                            }
                        }
                        set<int> tys;
                        for (auto [x, y, ty] : BB) tys.insert(ty);
                        if (tys.size() == 1) {
                            return pos == mpr(-1, -1) ? mpr(i, j) : pos;
                        }
                        new_states.pb(mpr(val, mpr(pos == mpr(-1, -1) ? mpr(i, j) : pos, BB)));
                    }
                }
            }
            sort(new_states.begin(), new_states.end(),[&](auto &a, auto &b){
                return a.fi>b.fi;
            });
            if (new_states.size() > lim) {
                new_states.resize(lim);
            }
            states.clear();
            for (auto [a, b] : new_states) {
                states.pb(b);
            }
        }
    };
    calc_m_and_beststra(A);
    cout << m << endl;

    while (1) {
        auto[qx,qy]=calc_m_and_beststra(A);
        cout << "? " << qx << ' ' << qy << endl;
        int res;
        cin >> res;
        // assert(A != mp[res]);
        A = get(qx,qy,A)[res];
        set<int> tys;
        for (auto [x, y, ty] : A) tys.insert(ty);
        if (tys.size() == 1) {
            cout << "! " << ans[*tys.begin()] << endl;
            break;
        }
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}