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 = []
A = []
B = []

for i in range(n):
	a = list(map(int,input().split()))
	W.append(a)
	A.append([0,0,0])
	B.append([0,0,0])
	
for i in range(n):
		for j in range(n):
			if i!=j:
				A[i][j] = (W[i][j]+W[j][i])/2
				B[i][j] = (W[i][j]-A[i][j])
			else:
				A[i][j] = W[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()