#include <bits/stdc++.h>
#define int long long 
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
mt19937 rnd(4);
int gen(int l,int r) {return rnd()%(r-l+1)+l;}
const int INF=5e5+5;
const int INFN=1e3+5;
int n,v3[INF],pre[INF],p[INF];
vector <pii> cnt;
map <int,map<int,int> >Map;
char cc[INFN][INFN];
char query(int x,int y) {
    if (Map[x][y]) return cc[x][y];
    char c;cout<<"? "<<x<<" "<<y<<endl;
    cin>>c;cc[x][y]=c;Map[x][y]=1;return c;
}
void solve() {
    cin>>n;cnt.clear();Map.clear();
    for (int i=0;i<=n*2;i++) pre[i]=0;
    for (int i=1;i<=n*2;i++) p[i]=i;
    for (int i=1;i<=n;i++) {
        int x=p[i],y=p[i+n];
        char c=query(x,y);
        if (c=='<') cnt.pb({x,0}),pre[x]=y;
        else cnt.pb({y,0}),pre[y]=x;
    }
    sort(cnt.begin(),cnt.end(),[](pii x,pii y){return query(x.fi,y.fi)=='<';});
    int M=cnt.back().fi;cnt.pop_back();
    int T=n;
    while (T--) {
        int len=cnt.size(),x=cnt[0].fi,sum2=0;
        for (int i=1;i<len;i++) {
            char c=query(cnt[i].fi,x);
            if (c=='<') x=cnt[i].fi;
            sum2+=!cnt[i].se;
        }
        if (!sum2) {
            char c=query(M,x);
            if (c=='<') x=M;
        }
        vector < pii > cnt1;
        if (!pre[x]) ;
        else cnt1.pb({pre[x],1});
        for (int i=0;i<len;i++)
            if (cnt[i].fi==x) ;
            else cnt1.pb(cnt[i]);
        cnt=cnt1;
    }
    cout<<"!"<<endl;
}
signed main()
{
    int t=0;cin>>t;
    while (t--) solve();
    return 0;
}