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

int main() {
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        if(n == 3){
            solve_3();
            continue;
        }
        memset(asked, 0, sizeof(asked));
        vector<pair<int, int>> vec;
        for(int i = 1; i <= 2*n; i++){
            g[i].clear();
            rg[i].clear();
            for(int j = 1; j < i; j++)vec.push_back({i, j});
        }
        shuffle(vec.begin(), vec.end(), rng);
        while(true){
            bool br = 1;
            for(auto p: vec){
                if(asked[p.first][p.second])continue;
                bool f1 = 0, f2 = 0;
                int cnt = 0;
                memset(vis, 0, sizeof(vis));
                dfs(p.first, cnt);
                if(cnt > n)f1 = 1;

                memset(vis, 0, sizeof(vis));
                rdfs(p.first, cnt);
                if(cnt > n)f1 = 1;
                cnt = 0;
                memset(vis, 0, sizeof(vis));
                dfs(p.second, cnt);
                if(cnt > n)f2 = 1;

                cnt = 0;
                memset(vis, 0, sizeof(vis));
                rdfs(p.second, cnt);
                if(cnt > n)f2 = 1;


                if(f1 || f2)continue;
                asked[p.first][p.second] = 1;
                cout << "? " << p.first << " " << p.second << endl;

                char c;
                cin >> c;
                if(c == '>'){
                    g[p.first].push_back(p.second);
                    rg[p.second].push_back(p.first);
                }
                else {
                    rg[p.first].push_back(p.second);
                    g[p.second].push_back(p.first);
                }
                br = 0;
            }
            if(br)break;
        }
        while(true){
            bool br = 1;
            for(auto p: vec){
                if(asked[p.first][p.second])continue;
                bool f1 = 0, f2 = 0;
                int cnt = 0;
                memset(vis, 0, sizeof(vis));
                dfs(p.first, cnt);
                if(cnt > n)f1 = 1;

                memset(vis, 0, sizeof(vis));
                rdfs(p.first, cnt);
                if(cnt > n)f1 = 1;
                cnt = 0;
                memset(vis, 0, sizeof(vis));
                dfs(p.second, cnt);
                if(cnt > n)f2 = 1;

                cnt = 0;
                memset(vis, 0, sizeof(vis));
                rdfs(p.second, cnt);
                if(cnt > n)f2 = 1;


                if(f1 && f2)continue;
                asked[p.first][p.second] = 1;
                cout << "? " << p.first << " " << p.second << endl;

                char c;
                cin >> c;
                if(c == '>'){
                    g[p.first].push_back(p.second);
                    rg[p.second].push_back(p.first);
                }
                else {
                    rg[p.first].push_back(p.second);
                    g[p.second].push_back(p.first);
                }
                br = 0;
            }
            if(br)break;
        }
        cout << "!" << endl;
    }
}