Problem: Sasha likes investigating different math objects, for example, magic squares. But Sasha understands that magic squares have already been studied by hundreds of people, so he sees no sense of studying them further. Instead, he invented his own type of square — a prime square. 

A square of size n × n is called prime if the following three conditions are held simultaneously: 

  * all numbers on the square are non-negative integers not exceeding 10^5; 
  * there are no prime numbers in the square; 
  * sums of integers in each row and each column are prime numbers. 



Sasha has an integer n. He asks you to find any prime square of size n × n. Sasha is absolutely sure such squares exist, so just help him!

Input

The first line contains a single integer t (1 ≤ t ≤ 10) — the number of test cases.

Each of the next t lines contains a single integer n (2 ≤ n ≤ 100) — the required size of a square.

Output

For each test case print n lines, each containing n integers — the prime square you built. If there are multiple answers, print any.

Example

Input


2
4
2


Output


4 6 8 1
4 9 9 9
4 10 10 65
1 4 4 4
1 1
1 1

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BPrimeSquare solver = new BPrimeSquare();
        solver.solve(1, in, out);
        out.close();
    }

    static class BPrimeSquare {
        public void solve(int testNumber, Scanner sc, PrintWriter pw) {
            int t = 1;
            t = sc.nextInt();
            while (t-- > 0) {
                int n = sc.nextInt();
                int[][] arr = new int[n][n];
                if (n % 2 == 0) {
                    int j = 0;
                    for (int i = 0; i + 1 < n; i += 2) {
                        arr[i][j] = 1;
                        arr[i + 1][j] = 1;
                        arr[i][j + 1] = 1;
                        arr[i + 1][j + 1] = 1;
                        j += 2;
                    }
                    for (int i = 0; i < n; i++) {
                        for (int k = 0; k < n; k++) {
                            pw.print(arr[i][k] + " ");
                        }
                        pw.println();
                    }
                } else {
                    int j = 0;
                    for (int i = 0; i + 1 < n; i += 2) {
                        arr[i][j] = 1;
                        arr[i + 1][j] = 1;
                        arr[i][j + 1] = 1;
                        arr[i + 1][j + 1] = 1;
                        j += 2;
                    }
                    arr[0][n - 1] = 1;
                    arr[n - 1][0] = 1;
                    arr[n - 1][n - 1] = 1;
                    for (int i = 0; i < n; i++) {
                        for (int k = 0; k < n; k++) {
                            pw.print(arr[i][k] + " ");
                        }
                        pw.println();
                    }
                }
            }
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(FileReader r) {
            br = new BufferedReader(r);
        }

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}