#include<iostream>
#include<vector>
#include<bitset>
#include<algorithm>
#include<cmath>
#include<string>
#include<queue>
#include<numeric>//iota -- iota(all(a), x) a从头到尾从x开始递增
#include<cstring>
#include<ctime>
#include<array>
#include<list>
#include<random>
#include<tuple>
#include<deque>
#include<map>
#include<stack>
#include<set>
using namespace std;
template <typename Dtype>
unsigned int __builtin_popcount(Dtype u){
    u = (u & 0x55555555) + ((u >> 1) & 0x55555555);
    u = (u & 0x33333333) + ((u >> 2) & 0x33333333);
    u = (u & 0x0F0F0F0F) + ((u >> 4) & 0x0F0F0F0F);
    u = (u & 0x00FF00FF) + ((u >> 8) & 0x00FF00FF);
    u = (u & 0x0000FFFF) + ((u >> 16) & 0x0000FFFF);
    return u;
}//wishchin!!!  
#define IOS ios::sync_with_stdio(false);cin.tie(0), cout.tie(0)
#define int long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define pf push_front
#define lowbit(x) (x & (-x))
const int xy[][2] = { 0,1, 0, -1, 1, 0, -1, 0 };
#define mem(a, x) memset(a, x, sizeof a)
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<char, char> PCC;
typedef pair<int, char> PIC;
typedef pair<char, int> PCI;
#define x first
#define y second
#define NO cout << "NO\n"
#define YES cout << "YES\n"
inline int read();
const int INF = 1e9, N = 1e4 + 10, MOD = 998244353, M = 1e4 + 10, K = 131;
const double PI = acos(-1.0);
inline int ask(int u, int v) {
    cout << "? " << u << " " << v << "\n\n"; fflush(stdout);
    int x; cin >> x;
    return x;
}
inline void answer(int x) {
    cout << "! " << x << "\n\n"; fflush(stdout);
}
void solve() {
    int n; cin >> n;
    int u = -1, v = -1;
    for (int i = 1; i <= n; i += 2)
        if (ask(i, i + 1))u = i, v = i + 1;
    if (n % 2)
        if (ask(n - 1, n))u = n - 1, v = n;
    if (u == -1)return answer(1), void();
    int x = -1, y = -1;
    for(int i = 1; i <= n; i++)
        if (i != u && i != v) {
            if (x == -1)x = i;
            else {
                y = i;
                break;
            }
        }
    if (ask(u, x)) {
        answer(ask(u, y) + 1);
    }
    else {
        int t2 = ask(v, x);
        if (!t2)return answer(1), void();
        t2 = ask(v, y);
        if (t2)answer(2);
        else answer(1);
    }
}
signed main() {
    IOS;
    int _ = 1;
    cin >> _;
    while (_--)solve();
    return 0;
}
inline int read()
{
    int x = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch>'9') { if (ch == '-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = x * 10 + ch - 48; ch = getchar(); }
    return x * f;
}
/*   /\_/\
*   (= ._.)
*   / >  \>
*/