Problem: A big football championship will occur soon! n teams will compete in it, and each pair of teams will play exactly one game against each other.

There are two possible outcomes of a game:

  * the game may result in a tie, then both teams get 1 point; 
  * one team might win in a game, then the winning team gets 3 points and the losing team gets 0 points. 



The score of a team is the number of points it gained during all games that it played.

You are interested in a hypothetical situation when all teams get the same score at the end of the championship. A simple example of that situation is when all games result in ties, but you want to minimize the number of ties as well.

Your task is to describe a situation (choose the result of each game) so that all teams get the same score, and the number of ties is the minimum possible.

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases.

Then the test cases follow. Each test case is described by one line containing one integer n (2 ≤ n ≤ 100) — the number of teams.

Output

For each test case, print (n(n - 1))/(2) integers describing the results of the games in the following order: the first integer should correspond to the match between team 1 and team 2, the second — between team 1 and team 3, then 1 and 4, ..., 1 and n, 2 and 3, 2 and 4, ..., 2 and n, and so on, until the game between the team n - 1 and the team n.

The integer corresponding to the game between the team x and the team y should be 1 if x wins, -1 if y wins, or 0 if the game results in a tie.

All teams should get the same score, and the number of ties should be the minimum possible. If there are multiple optimal answers, print any of them. It can be shown that there always exists a way to make all teams have the same score.

Example

Input


2
2
3


Output


0 
1 -1 1 

Note

In the first test case of the example, both teams get 1 point since the game between them is a tie.

In the second test case of the example, team 1 defeats team 2 (team 1 gets 3 points), team 1 loses to team 3 (team 3 gets 3 points), and team 2 wins against team 3 (team 2 gets 3 points).

Solution (in CPP):

Solution:
#include <string.h>
#include <assert.h>
#include <cassert>
#include <unordered_map>

#include <sstream>
#include <stdio.h>
#include <assert.h>
#include <math.h>
#include <bitset>
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <set>

#include <map>
#include <vector>
#include <string>
#include <stdlib.h>
#include <cassert>

#define ll long long
#define clr(x) memset(x,0,sizeof(x))
#define _clr(x) memset(x,-1,sizeof(x))
#define fr(i,a,b) for(int i = a; i < b; ++i)
#define frr(i,a,b) for(int i = a; i > b; --i)
#define pb push_back
#define sf scanf

#define pf printf
#define mp make_pair
#define N 300010

const int mod = 1e9+7;

using namespace std;



int g[101][101];
int v[101][101];

int n;
vector<int> ans;

void dfs(int t){
    for(int i = 0; i <n;++i) {
        if(g[t][i]>0){
            g[t][i] = 0;
            g[i][t] = 0;
            dfs(i);
        }
    }
    ans.pb(t);
    //printf("t = %d\n",t);
}

int main(){
    int t;
    cin>>t;
    while(t--){
        cin>>n;
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < n; ++j){
                g[i][j] = 1;
                v[i][j] = 0;
            }
            g[i][i] = 0;
        }
        if(n%2==0){
            for(int i = 0; i < n; i+=2){
                g[i][(i+1)%n]=0;
                g[(i+1)%n][i]=0;
            }
        }
        ans.clear();
        dfs(0);
        for(int i = 0; i+1< ans.size();++i){
            v[ans[i]][ans[i+1]]=1;
            v[ans[i+1]][ans[i]]=-1;
        }
        for(int i = 0; i < n; ++i){
            for(int j = i+1; j < n; ++j) {
                printf("%d ",v[i][j]);
            }
        }
        printf("\n");
    }
}