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 sys
from os import path
from collections import Counter
if(path.exists("inp.txt")):
	sys.stdin = open("inp.txt",'r')
	sys.stdout = open("out.txt",'w')
import math
n=int(input())
w=[]
li=[0]*((2*n)-1)
for i in range(n):
	temp=list(map(int,input().split()))
	w.append(temp)
c=0
for i in range(n):
	for j in range(n):
		li[i+j]=li[i+j]+w[i][j]
ans=[[0 for i in range(n)] for j in range(n)]
ans1=[[0 for i in range(n)] for j in range(n)]
b=n
x=[n]
while(n!=1):
	x.insert(0,n-1)
	x.append(n-1)
	n-=1

for i in range(b):
	for j in range(b):
		ans[i][j]=li[i+j]/x[i+j]
for i in range(b):
	for j in range(b):
		ans1[i][j]=w[i][j]-ans[i][j]
for i in ans:
	print(*i)
for i in ans1:
	print(*i)