1IXMMMl3SjkTFF#:*||

该比赛已结束,您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Statement

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 n \times n is called prime if the following three conditions are held simultaneously:

  • all numbers on the square are non-negative integers not exceeding 105 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 n . He asks you to find any prime square of size n×n n \times n . Sasha is absolutely sure such squares exist, so just help him!

Format

Input

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

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

Output

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

Sample

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

ShanghaiTech ACM 炸鱼杯

未参加
状态
已结束
规则
OI
题目
46
开始于
2024-12-10 23:00
结束于
2024-12-15 13:00
持续时间
110 小时
主持人
参赛人数
112