#include<bits/stdc++.h>
using namespace std;
#include <unordered_set>
#include <random>
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};




void solve(){
    ll T;cin>>T;
    while(T--){
        ll N;cin>>N;
        vector<ll>P(N,-1);
        vector<ll>A(N-1);
        rep(i,N-1)A[i]=i%2;
        cout<<"? ";
        rep(i,N-1)cout<<A[i]<<' ';
        cout<<endl;
        vector<ll>B(N);
        rep(i,N)cin>>B[i];
        P[0]=B[0];
        REP(i,1,N){
            if(B[i]!=B[i-1])P[i]=B[i];
            else{
                A[i-1]=1-A[i-1];
            }
        }
        while(1){
            bool f=1;
            rep(j,N){
                if(P[j]==-1)f=0;
            }
            if(f)break;
            cout<<"? ";
            rep(i,N-1)cout<<A[i]<<' ';
            cout<<endl;
            rep(i,N)cin>>B[i];
            REP(i,1,N){
                if(P[i]>=0)continue;
                if(B[i]!=B[i-1])P[i]=B[i];
                else{
                    A[i-1]=1-A[i-1];
                }
            }
        }
        cout<<"! ";
        rep(i,N){
            cout<<P[i]<<' ';
        }
        cout<<endl;
    }
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}