#include <bits/stdc++.h>
using namespace std;

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=Int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}

//INSERT ABOVE HERE
void solve(){
  Int n;
  cin>>n;

  vector<Int> ps(n,-1);

  Int cnt=0;
  while(true){
    cout<<"?";
    for(Int i=1;i<n;i++) cout<<' '<<((i+cnt)&1);
    cout<<endl;
    cnt++;

    auto bs=read(n);

    ps[0]=bs[0];
    for(Int i=1;i<n;i++)
      if(bs[i-1]!=bs[i]) ps[i]=bs[i];

    if(*min_element(ps.begin(),ps.end())>0) break;
  }
  cout<<"!";
  for(Int i=0;i<n;i++) cout<<' '<<ps[i];
  cout<<endl;
}

signed main(){
  Int T;
  cin>>T;
  while(T--) solve();
  return 0;
}