#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,-1,0,1,1,1,-1,-1,0};
const ll dx[9]={-1,0,1,0,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
void clar(vl v){
    cout << "? ";
    rep(i,v.size())cout << v[i]<<" ";cout << endl;
}
void solve(){
    ll n;cin >> n;
    vl ans(n,-1);
    vl qs(n-1,0);
    rep(i,n-1)if(i&1)qs[i]=1;
    clar(qs);
    vl ts(n);
    rep(i,n)cin >> ts[i];
    ll ds=-1;
    rep(i,n){
        if(ts[i]!=ds){
            ans[i]=ts[i];
            ds=ts[i];
        }
    }
    //rep(i,n-1)if(ans[i+1]==-1)qs[i]^=1;
    rep(i,n-1)qs[i]^=1;
    clar(qs);
    rep(i,n)cin >> ts[i];
    ds=-1;
    rep(i,n){
        if(ts[i]!=ds){
            ans[i]=ts[i];
            ds=ts[i];
        }
    }
    cout << "! ";
    rep(i,n)cout << ans[i] <<" ";cout << endl;
}
int main(){
    ll t;cin >> t;
    while(t--){
        solve();
    }
}