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 = [0 for i in range(N)]
for i in range(N):
	W[i] = list(map(int, input().split()))
A = [[0 for i in range(N)] for i in range(N)]
B = [[0 for i in range(N)] for i in range(N)]
for i in range(N):
	for j in range(N):
		A[i][j] = (W[i][j] + W[j][i]) / 2
		B[i][j] =  W[i][j] - A[i][j]
for i in range(N):
	for j in range(N):
		print(A[i][j], end = ' ')
	print()
for i in range(N):
	for j in range(N):
		print(B[i][j], end = ' ')
	print()