Binary Pattern Problem Statement

Given an input integer N, your task is to print a binary pattern as follows:

Example:

Input:

N = 4

Output:

1111
000
11
0

Explanation:

The first line contains 'N' 1s. The next line contains 'N - 1' 0s, followed by 'N - 2' 1s on the next line, and so forth.

Input:

The first line of input contains an integer 'T' representing the number of test cases.
The first line of each test case contains a single integer 'N'.

Output:

For each test case, print 'N' lines containing the pattern, where the 'I-th' line contains N - I + 1 numbers alternatively being 1 or 0, depending on the 'I' value.

Constraints:

• 1 ≤ T ≤ 10
• 1 ≤ N ≤ 103
• Time Limit: 1 sec