Chubby Yang is studying linear equations right now. He came up with a nice problem. In the problem you are given an *n* × *n* matrix *W*, consisting of integers, and you should find two *n* × *n* matrices *A* and *B*, all the following conditions must hold: 
 -  *A*<sub class="lower-index">*ij*</sub> = *A*<sub class="lower-index">*ji*</sub>, for all *i*, *j* (1 ≤ *i*, *j* ≤ *n*); -  *B*<sub class="lower-index">*ij*</sub> =  - *B*<sub class="lower-index">*ji*</sub>, for all *i*, *j* (1 ≤ *i*, *j* ≤ *n*); -  *W*<sub class="lower-index">*ij*</sub> = *A*<sub class="lower-index">*ij*</sub> + *B*<sub class="lower-index">*ij*</sub>, for all *i*, *j* (1 ≤ *i*, *j* ≤ *n*). 
Can you solve the problem?
The first line contains an integer *n* (1 ≤ *n* ≤ 170). Each of the following *n* lines contains *n* integers. The *j*-th integer in the *i*-th line is *W*<sub class="lower-index">*ij*</sub> (0 ≤ |*W*<sub class="lower-index">*ij*</sub>| &lt; 1717).
R = lambda: list(map(int, input().split()))
n = int(input())
w  = [R() for _ in ' '*n]
wd = [[0]*n for _ in ' '*n]

for i in range(n):
    for j in range(n):
        wd[i][j] = w[j][i]
        
a = [[0]*n for _ in ' '*n]
b = [[0]*n for _ in ' '*n]

for i in range(n):
    for j in range(n):
        a[i][j] = (w[i][j] + wd[i][j])/2
        b[i][j] = (w[i][j] - wd[i][j])/2

for i in a: print(*i)
for i in b: print(*i)