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).
size = int(input())
w = []

for enu in range(size):
    temp = input().split()
    w.append(list(map(int, temp)))
A = [[0 for i in range(size)] for j in range(size)]
B = [[0 for i in range(size)] for j in range(size)]
for i in range(size):
    for j in range(i, size):
        A[i][j] = (w[i][j] + w[j][i]) / 2
        B[i][j] = (w[i][j] - w[j][i]) / 2
        A[j][i] = A[i][j]
        B[j][i] = -B[i][j]
def pr(A):
    global size
    for i in range(size):
        for j in range(size - 1):
            print("%.8f" % A[i][j], end = ' ')
        print('%.8f' % A[i][-1])
pr(A)
pr(B)