#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int n;
VI a, b, p;

void query() {
  cout << "?";
  rep(i, n - 1) cout << ' ' << a[i];
  cout << endl;
  rep(i, n) cin >> b[i];
}

void answer() {
  cout << "!";
  rep(i, n) cout << ' ' << p[i];
  cout << endl;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while(tt--) {
    cin >> n;
    a.resize(n);
    b.resize(n);
    p.resize(n);
    rep(i, n - 1) a[i] = i % 2;
    query();
    
    VI idx;
    idx.emplace_back(0);
    rep(i, n - 1) if (b[i] != b[i+1]) idx.emplace_back(i + 1);
    int sz = idx.size();
    rep(z, 2) {
      rep(i, sz) {
        int s = idx[i], t = i == sz - 1 ? n : idx[i + 1];
        if (i % 2 == z) {
          for(int i = s; i < t - 1; i++) a[i] = !(i % 2);
          if (i + 2 < sz) a[t - 1] = idx[i + 2] % 2;
        } else if (t < n) {
          int x = t % 2;
          for(int i = s; i < t - 1; i++) a[i] = x;
          a[t - 1] = !x;
        }
      }
      query();
      rep(i, sz) {
        int s = idx[i], t = i == sz - 1 ? n : idx[i + 1];
        if (i % 2 == z) {
          for(int i = s; i < t; i++) p[i] = b[i];
        }
      }
    }
    answer();
  }
}