#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back

using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;

int cnt = 1, tot = 0;
pii pre[2001][2001];

pii cmp(pii a, pii b) {
    if (a.fi == 1e9) {
        return b;
    }
    if (b.fi == 1e9) {
        return a;
    }
    if (pre[a.fi][b.fi].fi != -1) {
        return pre[a.fi][b.fi];
    }
    cout << "? " << a.fi << ' ' << b.fi << endl;
    int ret;
    cin >> ret;
    pre[a.fi][b.fi] = pre[b.fi][a.fi] = (ret == 0 ? a:b);
    return (ret == 0 ? a:b);
}

struct SegmentTree {
    int n;
    vi t;
    SegmentTree(int sz) {
        n = sz, t.resize(4*n + 1, 1e9), build(1, 0, n - 1);
        return;
    }
    void build(int v, int tl, int tr) {
        if (tl == tr) {
            t.at(v) = cnt++;
        }
        else {
            int tm = (tl + tr)/2;
            build(v*2, tl, tm), build(v*2 + 1, tm + 1, tr);
            t.at(v) = cmp({t.at(v*2), tot}, {t.at(v*2 + 1), tot}).fi;
        }
        return;
    }
    void remove(int v, int tl, int tr, int Min) {
        if (tl == tr) {
            t.at(v) = 1e9;
        }
        else {
            int tm = (tl + tr)/2;
            (t.at(v*2) == Min ? remove(v*2, tl, tm, Min):remove(v*2 + 1, tm + 1, tr, Min));
            t.at(v) = cmp({t.at(v*2), tot}, {t.at(v*2 + 1), tot}).fi;
        }
        return;
    }
    int get() {
        return t.at(1);
    }
};

pii DnC(int L, int R, vector<SegmentTree>& a) {
    if (L == R) {
        return {a.at(L).get(), L};
    }
    int M = (L + R)/2;
    pii left = DnC(L, M, a), right = DnC(M + 1, R, a);
    if (left.fi == 1e9) {
        return right;
    }
    if (right.fi == 1e9) {
        return left;
    }
    if (pre[left.fi][right.fi].fi != -1) {
        return pre[left.fi][right.fi];
    }
    pre[left.fi][right.fi] = pre[right.fi][left.fi] = cmp(left, right);
    return pre[left.fi][right.fi];
}

vector<SegmentTree> Blocks;

int main() {
    for(int i = 0;i<=2000;++i) {
        for(int j = 0;j<=2000;++j) {
            pre[i][j] = {-1, -1};
        }
    }
    int tt, sz;
    cin >> tt;
    while(tt--) {
        cin >> sz;
        Blocks.pb(SegmentTree(sz));
        pii Min = DnC(0, Blocks.size() - 1, Blocks);
        Blocks.at(Min.se).remove(1, 0, Blocks.at(Min.se).n - 1, Min.fi), tot++;
        cout << "! " << Min.fi << endl;
    }
    return 0;
}