#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;

struct VectorHash {
    size_t operator()(const std::vector<array<int,3>> &vec) const {
        std::hash<ll> hasher;
        size_t seed = 0;
        for (auto i : vec) {
            seed ^= hasher(i[0] * (ll(1e12)) + i[1]*(ll(1e6))+i[2]) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
        }
        return seed;
    }
};

struct VectorEqual {
    bool operator()(const std::vector<array<int,3>> &lhs, const std::vector<array<int,3>> &rhs) const {
        return lhs == rhs;
    }
};

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) {
        static pair<int, int> tmp[30];
        int tmpcnt = 0;
        if (ty == 0) {
            for (int i = -1; i <= 1; i += 2) {
                tmp[tmpcnt++] = {x + i, y};
                tmp[tmpcnt++] = {x, y + i};
            }
        } else if (ty == 1) {
            for (int i = -1; i <= 1; i += 2) {
                for (int j = -1; j <= 1; j += 2) {
                    tmp[tmpcnt++] = {x + i, y + j};
                }
            }
        } else if (ty == 2) {
            for (int r = 0; r < 10; r++)
                if (r != x) tmp[tmpcnt++] = {r, y};
            for (int c = 0; c < 9; c++)
                if (c != y) tmp[tmpcnt++] = {x, c};
        } else if (ty == 3) {
            for (int i = -2; i <= 2; i += 4) {
                for (int j = -1; j <= 1; j += 2) {
                    tmp[tmpcnt++] = {x + i, y + j};
                    tmp[tmpcnt++] = {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[tmpcnt++] = {x + i, y + j};
                }
            }
        } else {
            tmp[tmpcnt++] = {x + 1, y};
            if (x > 4) {
                tmp[tmpcnt++] = {x, y + 1};
                tmp[tmpcnt++] = {x, y - 1};
            }
        }
        vector<pair<int, int>> res;
        for (int i = 0; i < tmpcnt; i++)
            if (valid(tmp[i].fi, tmp[i].se)) res.push_back(tmp[i]);
        return res;
    };
    int big = 0;
    vector f(10, vector(9, vector(6, vector(10, vector(9, 0)))));
    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] = 1;
                while (q.size()) {
                    auto [x, y] = q.front();
                    q.pop();
                    for (auto [tx, ty] : getTo(x, y, ty)) {
                        if (g[tx][ty] == 0) {
                            g[tx][ty] = g[x][y] + 1;
                            big = max(big, g[tx][ty]);
                            q.push({tx, ty});
                        }
                    }
                }
            }
        }
    }
    cerr << big << "\n";
    int n;
    cin >> n;
    using B = vector<array<int, 3>>;
    auto id = [&](int x, int y, int ty) {
        return (x * 9 + y) * 6 + ty;
    };
    auto rid = [&](int id) {
        return make_tuple(id / 6 / 9, id / 6 % 9, id % 6);
    };
    B A;
    for (int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        for (int j = 0; j < 6; j++) {
            A.pb({x, y, j});
        }
    }
    sort(A.begin(), A.end());

    unordered_map<vector<array<int, 3>>, int, VectorHash, VectorEqual> g;
    unordered_map<vector<array<int, 3>>, pair<int, int>, VectorHash, VectorEqual> best;

    // A.flip();
    // print(A);
    auto get = [&](int i, int j, const B &A) {
        vector<int> res;
        for (auto [a, b, c] : A) {
            res.pb(f[a][b][c][i][j]);
        }
        return res;
    };
    auto getty = [&](const B &A) {
        vector<int> tys(6, 0);
        for (auto [x, y, ty] : A) {
            tys[ty] = 1;
        }
        if (accumulate(tys.begin(), tys.end(), 0) > 1) return -1;
        for (int i = 0; i < 6; i++)
            if (tys[i]) return i;
    };
    int nodecnt = 0;
    auto dfs1 = [&](auto self, const B &A, int dep, int mxdep) {
        if (getty(A) != -1) return 0;
        if (g.count(A)) return g[A];
        if (dep > mxdep) return 10;
        // cerr << dep << '\n';
        int ga = 10;
        ++nodecnt;
        pair<int, int> bst;
        array<vector<array<int, 3>>, 20> mp;
        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < 9; j++) {
                auto nG = get(i, j, A);
                for (int k = 0; k < A.size(); k++) {
                    mp[nG[k]].pb(A[k]);
                }
                int mx = 0;
                for (int k = 0; k < 20; k++) {
                    if (mp[k].empty()) continue;
                    mx = max(mx, self(self, mp[k], dep + 1, mxdep) + 1);
                    if (mx > mxdep || mx >= ga) break;
                }
                if (mx < ga) {
                    ga = mx;
                    bst = {i, j};
                }
                for (int k = 0; k < A.size(); k++) {
                    mp[nG[k]].clear();
                }
            }
        }
        best[A] = bst;
        return g[A] = ga;
    };
    dfs1(dfs1, A, 0, 3);
    cerr << nodecnt << "\n";
    cout << g[A] << endl;
    auto dfs2 = [&](auto self, B A) {
        // print(A);
        // cerr << g[A] << '\n';
        if (getty(A) != -1) {
            cout << "! " << "JSCMXB"[getty(A)] << endl;
            return;
        }
        auto [x, y] = best[A];
        cout << "? " << x << ' ' << y << endl;
        int res;
        cin >> res;
        // print(G[A][res]);
        auto nG = get(x, y, A);
        array<vector<array<int, 3>>, 30> mp;
        for (int k = 0; k < A.size(); k++) {
            mp[nG[k]].pb(A[k]);
        }
        self(self, mp[res + 1]);
    };
    dfs2(dfs2, A);
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}