#include <bits/stdc++.h>
#define MULTI int _; cin >> _; while(_--)
#define fi first
#define se second
#define pb(a) push_back(a)
#define rep(i, n) for(int i = 0; i < n; i++)
#define reps(i, n, m) for(int i = n; i <= m; i++)
#define repsv(i, n, m) for(int i = n; i >= m; i--)
#define vsz(a) (int)(a.size())
#define mp(a, b) make_pair(a, b)
#define all(a) a.begin(), a.end()

using namespace std;

typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;

#ifdef LOCAL
#include "debugs.hpp"
#else
#define dbg(...) 0
#endif

int n;
vi a;

bool ask(int x, int y){
    cout << "? " << x << ' ' << y << '\n';
    char in;
    cin >> in;
    return in == '<';
}

int cmp(int l, int r){
    if(l==r) return a[l];
    else{
        int m = (l+r)/2;
        int v1 = cmp(l, m);
        int v2 = cmp(m+1, r);
        if(v1 != -1) swap(v1, v2);
        if(v1 == -1 && v2 == -1)
            return -1;
        if(v1 == -1)
            return v2;
        if(ask(v1, v2))
            return v1;
        else
            return v2;
    }
}

void s3(){
    vector<bool> isnoob(7);
    rep(i, 3){
        if(ask(2*i+1, 2*i+2))
            isnoob[2*i+1] = true;
        else
            isnoob[2*i+2] = true;
    }
    vi nulos; rep(i, 7) if(isnoob[i]) nulos.pb(i);
    int x = nulos[0], y = nulos[1], z = nulos[2];
    int w; // le moins nulos
    if(ask(x,y)){
        if(ask(y, z))
            w = z;
        else
            w = y;
    }
    else{
        if(ask(x, z))
            w = z;
        else
            w = x;
    }
    vi reste;
    rep(i, 3){
        if(i*2+1 != w && i*2+2 != w){
            if(!isnoob[i*2+1])
                reste.pb(i*2+1);
            if(!isnoob[i*2+2])
                reste.pb(i*2+2);
        }
    }
    x = reste[0], y = reste[1];
    if(ask(x, y))
        ask(x, w);
    else
        ask(y, w);
    cout << "!\n";
}

void solve(){
    cin >> n;
    if(n==3){
        s3();
        return;
    }
    n *= 2;
    a = vi(n);
    rep(i, n) a[i] = i+1;
    rep(i, n/2){
        int noob = cmp(0, n-1);
        a[noob-1] = -1;
    }
    cout << "!\n";
}

int main(){
    ios_base::sync_with_stdio(false);
    MULTI
    solve();
}