#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define debug(a) cout<<a<<'\n'
#define Pll pair<ll,ll>
#define PII pair<int,int>
#define ft first
#define sd second
#define vec vector
#define pushk push_back
#define ump unordered_map
#define pl p<<1
#define pr p<<1|1
using namespace std;
const int N = 5e5 + 10, M = 1e4 + 10, mod = 1e9+7;
const ll inf = 1e18;
const ld eps = 1e-13;
int mov[4][2] = { {0,1},{1,0},{-1,0},{0,-1} }, dx, dy, _ = 1, __ = 1;
void bout(bool f) {
	if (f)cout << "YES\n";
	else cout << "NO\n";
}
ll n, m, k;
int a[N],re[N],ans[N];
bool st[N];

bool check(int m,int i){
	int a,b,c,d;
	cout<<"? "<<m<<' '<<i<<endl;
	cin>>a;
	if(m==i-1){
		return a;
	}
	cout<<"? "<<m+1<<' '<<i<<endl;
	cin>>b;
	c=re[m];
	d=re[m+1];
	a=a-b-c+d;
	a=(a%2+2)%2;
	return a;
}

void ini() {
	
}
void solve() {
	cin>>n;
	int x,y,l,r,m;
	for(int i=1;i<=n;++i){
		l=0,r=i;
		while(l<r-1){
			m=l+r>>1;
			if(check(m,i))r=m;
			else l=m;		
		}
		for(int j=i;j>r;--j){
			a[j]=a[j-1];
			st[a[j]]=1;
		}
		a[r]=i;
		x=0;
		for(int j=i;j>=1;--j){
			if(st[j])++x;
			re[j]+=x;
		}
		for(int j=1;j<=i;++j)st[j]=0;
	}
	for(int i=1;i<=n;++i){
		ans[a[i]]=i;
	}
	cout<<"! ";
	for(int i=1;i<=n;++i)cout<<ans[i]<<' ';
	cout<<endl;
}

int main() {
//	ios::sync_with_stdio(0);
//	cin.tie(0);
//	cout.tie(0);
//#ifndef ONLINE_JUDGE
//	streambuf *cinbp=cin.rdbuf(),*coutbp=cout.rdbuf();
//	ifstream fin("in.txt");
//	ofstream fout("out.txt");	
//	cin.rdbuf(fin.rdbuf());
//	cout.rdbuf(fout.rdbuf());
//#endif
	//cin >> _;
	__ = _;
	ini();
	while (_--) {
		solve();
	}
	return 0;
}