#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")


    #define int long long
    

#define YES cout<<"YES\n";return; 
#define NO cout<<"NO\n";return; 
#define write(a) cout<<a<<"\n";return; 
#define F first 
#define S second

using namespace std;
using vi=vector<int>; 
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); //uid<int> u1(5, 10); u1(rnd);
long long powmod(long long a,long long b,long long mod) {
        if (b==0 || a==1)  {if (mod==1) return 0; else return 1; }
       
        if (b%2==0) { long long k=powmod(a,b/2,mod); return (k*k)%mod; }
        else {long long k=powmod(a,b/2,mod); return ( (k*k) %mod *a)% mod; }
}
long long gcd(long long a, long long b) {
    if (a==0) return b;
    if (b==0) return a;
    if (a>b) return gcd(a%b,b); else return gcd(b%a,a);
}
int prime(int p) { // 1 - простое
if (p==1) return 0; 
    for (int i=2;i*i<=p;i++) {
    if (p%i==0 && i<p) return i;  
    }
    return 1;
}
        
 int inv(int a, int mod) {
    return powmod(a,mod-2,mod); 
}
            
 int random_modul() {
        
    uniform_int_distribution <int> u1(1e9, 2e9);
    int pepega=u1(rnd); 
    while (prime(pepega)!=1) pepega=u1(rnd); 
    return pepega; 
}
    
template <typename T1> void ifmax(T1 &max, T1 kek) {
    if (kek>max) max=kek; 
    return; 
}
template <typename T1> void ifmin(T1 &min, T1 kek) {
    if (kek<min) min=kek;
    return; 
}
     

template <typename T1> istream& operator>> (std::istream& in, pair<T1,T1> & a) {
in>>a.first>>a.second; 
return in; 
    
}
    
template <typename T1> istream& operator>> (std::istream& in, vector<T1> & a) {
    for (int i=0;i<a.size();i++) in>>a[i]; 
    return in;
} 
     
template <typename T1>  ostream& operator<< (std::ostream& out, vector <T1> &b) {
    for (int i=0;i<b.size();i++) out<<b[i]; 
    return out; 
} 
template <typename T1> void sort(vector <T1> &m) {
    sort(m.begin(),m.end());
}

template <typename T1> void reverse(vector <T1> &m) {
 reverse(m.begin(),m.end());
}
int mod=1000000007; 
int fac[200005];
int inv_fac[200005]; 
int co(int a, int b) {
    int ans=1;
    ans*=fac[b]; 
    ans*=inv_fac[b-a]; ans%=mod; 
    ans*=inv_fac[a]; 
    return ans%mod; 
}    


void solve () {
           
           
     /* ---- !! F, S !!  ---- */
         
     int a;
     cin>>a;
     if (a%2==1) {
         for (int i=1;i<=a;i++) {
             for (int j=i+1;j<=a;j++) {
                 if ((j-i+a)%a<=a/2) cout<<"1 "; else cout<<"-1 "; 
             }
         }
         cout<<"\n"; return; 
     }
     
     for (int i=1;i<=a;i++) {
             for (int j=i+1;j<=a;j++) {
                 if ((j-i+a)%a<a/2) cout<<"1 "; 
                 if ((j-i+a)%a>a/2) cout<<"-1 "; 
                 if ((j-i+a)%a==a/2) cout<<"0 "; 
             }
         }
         cout<<"\n"; 
     
    /* --------- */  
    return;
    }
         
         
         
    signed main() {
   ios_base::sync_with_stdio(0);
   cin.tie(0);
   cout.tie(0); 
           
           
      cout<<fixed<<setprecision(10); 
           
           
        int multitest = 1 ;    
           
      int tututu;
      tututu=1;
      
      
     int combinatorics = 0;  
      
      if (combinatorics) { 
     fac[1]=1;
     fac[0]=1; 
     for (int i=2;i<200005;i++) {
         fac[i]=fac[i-1]*i; fac[i]%=mod; 
     }
     for (int i=0;i<200005;i++) {
         inv_fac[i]=inv(fac[i],mod); 
     }
      } 
      
      
      
      if (multitest) cin>>tututu; // если нет запросов, то закоментить
            
      for (int qwerty=0;qwerty<tututu;qwerty++) solve();
          
           
    return 0;
}
