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

n = int(input())
A = [[0.0]*n]*n
B = [[0.0]*n]*n
W = []
for i in range(n):
	W.append(list(map(int, input().split())))
for i in range(n):
	for j in range(n):
		if i!=j:
			if A[i][j] == 0:
				A[i][j] = A[j][i] = min(W[i][j], W[j][i])+abs(W[i][j]-W[j][i])/2
			if B[i][j]==0:
				B[i][j] = W[i][j] - A[i][j]
				B[j][i] = -B[i][j]
for i in range(n):
	for j in range(n):
		print(float(W[i][j]) if i==j else A[i][j], end=' ')
	print()
for i in range(n):
	for j in range(n):
		print(0.0 if i==j else B[i][j], end=' ')
	print()