Bobo learned the definition of determinant det(A) of matrix A in ICPCCamp. He also knew determinant
can be computed in O(n³) using Gaussian Elimination.
Bobo has an n×n matrix B he would like to find det(B_i,j) modulo (10⁹ +7) for all i, j ∈ {1, 2, . . . , n} where
B_i is the matrix after removing the i-th row and j-th column from B.
It is guaranteed that the each column sum of B is a multiple of (10⁹ + 7).

The input contains zero or more test cases and is terminated by end-of-file. For each test case:
The first line contains an integer n. The i-th of following n lines contains n integers B_i,1,B_i,2, . . . ,B_i,n.
• 2 ≤ n ≤ 500
• 0 ≤ B_i,j < 10⁹ + 7
• The sum of n does not exceed 5000.

For each case, output n rows where the i-th row contains n integers det(B_i,1), det(B_i,2), . . . , det(B_i,n) modulo
(10⁹ + 7).

2
0 1
0 1000000006

1000000006 0
1 0

2017年四川省赛