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).
# Design_by_JOKER
import math
import cmath

n = int(input())
w = []
a = []
b = []
for _ in range(n):
    w.append(list(map(int, input().split())))
    a.append([0.0]*n)
    b.append([0.0]*n)

for x in range(n):
    a[x][x] = 1.0*w[x][x]
    for y in range(x):
        a[x][y] = a[y][x] = (w[x][y] + w[y][x])/2
        b[x][y] = a[x][y] - w[x][y]
        b[y][x] = -b[x][y]

for x in range(n):
    for y in range(n):
        print(a[x][y], end=' ')
    print("")

for x in range(n):
    for y in range(n):
        print(b[x][y], end=' ')
    print("")
