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).
def nine(n,queries):
    A=[[0 for _ in range(n)] for _ in range(n)]
    B=[[0 for _ in range(n)] for _ in range(n)]
    for i in range(n):
        for j in range(i+1,n):
            a=queries[i][j]
            b=queries[j][i]
            x=(a+b)/2
            y=a-x
            A[i][j]=x
            A[j][i]=x
            B[i][j]=-y
            B[j][i]=y
    for k in range(n):
        A[k][k]=queries[k][k] 
    for i in range(n):
        print(' '.join(map(str,A[i])))
               
    for i in range(n):
        print(' '.join(map(str,B[i])))
    
    
    
n=int(input())
queries=[]
for _ in range(n):
    queries.append(list(map(int,input().split())))
nine(n,queries)
    