#include<bits/stdc++.h>
using namespace std;

const int maxn = 205;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

vector<int> g[maxn], rg[maxn];

bool vis[maxn];
bool asked[maxn][maxn];

void dfs(int x, int &cnt){
    vis[x] = 1;
    cnt++;
    for(auto v: g[x])if(!vis[v])dfs(v, cnt);
}

void rdfs(int x, int &cnt){
    vis[x] = 1;
    cnt++;
    for(auto v: rg[x])if(!vis[v])rdfs(v, cnt);
}

bool query(int a, int b){
    cout << "? " << a << " " << b << endl;
    char c;
    cin >> c;
    return c == '<';
}

void solve_3(){
    int arr[4] = {1, 2, 3, 0};
    // arr[0] < arr[1], arr[2] < arr[3]
    for(int i = 4; i <= 6; i++){
        for(int j = 0; j < 4; j++)if(!arr[j])arr[j] = i;
        if(!query(arr[0], arr[1]))swap(arr[0], arr[1]);
        if(!query(arr[2], arr[3]))swap(arr[2], arr[3]);
        if(query(arr[0], arr[2]))arr[0] = 0;
        else arr[2] = 0; 
    }
    cout << "!" << endl;
}

struct cmp{
    bool operator()(const int &lhs, const int &rhs)const{
        return !query(lhs, rhs);
    }
};

int main() {
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        if(n == 3){
            solve_3();
            continue;
        }
        memset(vis, 0, sizeof(vis));
        vector<int> P(2*n);
        iota(P.begin(), P.end(), 1);
        shuffle(P.begin(), P.end(), rng);
        priority_queue<int, vector<int>, cmp> pq;
        for(auto v: P){
            pq.push(v);
            if(pq.size() > n)pq.pop();
        }
        cout << "!" << endl;
    }
}