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).


n = int(input())

w = []
for i in range(n):
    wi = [int(x) for x in input().split()]
    w.append(wi)

a = []
b = []

for i in range(n):
    r1 = []
    r2 = []
    for j in range(n):
        if i<j:
            a1 = (w[i][j]+w[j][i])/2
            b1 = (w[i][j]-w[j][i])/2
        elif i>j:
            a1 = (w[i][j]+w[j][i])/2
            b1 = (w[i][j]-w[j][i])/2
        else:
            a1 = w[i][j]
            b1 = 0
        r1.append(a1)
        r2.append(b1)
    a.append(r1)
    b.append(r2)

for i in range(n):
    print(*a[i])

for i in range(n):
    print(*b[i])
