#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<assert.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define ll long long

void intIntSort(int d[],int m[],int s){int i=-1,j=s,k,t;if(s<=1)return;k=(d[0]+d[s-1])/2;for(;;){while(d[++i]<k);while(d[--j]>k);if(i>=j)break;t=d[i];d[i]=d[j];d[j]=t;t=m[i];m[i]=m[j];m[j]=t;}intIntSort(d,m,i);intIntSort(d+j+1,m+j+1,s-j-1);}

int N, M;
ll A[1001];

int res[1001], res_size;
int now[1001], now_size;

int val[1001];
int mat[100][100];
int unused[1001], unused_size;

void solve(void){
  int i, j, k, s;
  int r = M, c;
  int t, rank;

  now_size = 0;

  unused_size = N;
  rep(i,N) unused[i] = i, val[i] = rand()%100000000;
  intIntSort(val, unused, N);

  while(unused_size){
    int fnd = -1;

    c = unused_size;
    if(c > M+1) c = M+1;
    rep(i,c) rep(k,r) if(A[unused[i]] & 1LL<<k) mat[k][i] = 1; else mat[k][i] = 0;

    s = 0;
    rep(k,c){
      REP(i,s,r) if(mat[i][k]) break;
      if(i==r){ fnd = k; break; }
      if(i!=s){ rep(j,c) t=mat[i][j], mat[i][j]=mat[s][j], mat[s][j] = t; }

      rep(i,r) if(i!=s && mat[i][k]){
        rep(j,c) mat[i][j] ^= mat[s][j];
      }
      s++;
    }

    if(fnd == -1){
      rep(i,unused_size) now[unused[i]] = now_size;
      now_size++;
      break;
    } else {
      now[unused[fnd]] = now_size, unused[fnd] = -1;
      rep(i,fnd) if(mat[i][fnd]) now[unused[i]] = now_size, unused[i] = -1;
      now_size++;

      k = 0;
      rep(i,unused_size) if(unused[i] >= 0) unused[k++] = unused[i];
      unused_size = k;
    }
  }

  if(now_size > res_size){
    res_size = now_size;
    rep(i,N) res[i] = now[i];
  }
}

int main(){
  int T;
  int i, j;
  ll k;

  srand(time(NULL));

  assert( scanf("%d",&T)==1 );

  while(T--){
    assert( scanf("%d",&N)==1 );
    rep(i,N) assert( scanf("%lld",A+i)==1 ), assert( 1LL<=A[i] && A[i]<=(1LL<<60)-1 );

    k = 0;
    rep(i,N) if(k < A[i]) k = A[i];
    rep(i,61) if(k&1LL<<i) M = i+1;

    rep(i,N) res[i] = 0; res_size = 1;

    rep(i,10) solve();

    rep(i,N){
      if(i) putchar(' ');
      printf("%d",res[i]+1);
    }
    puts("");
  }

  return 0;
}