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())
a=[list(map(int,input().split())) for i in range(n)]

b=[[0 for j in range(n)] for i in range(n)]
c=[[0 for j in range(n)] for i in range(n)]

for i in range(n):
    for j in range(i,n):
        if(i==j):
            b[i][j]=a[i][j]/1
        else:
            x=(a[i][j]+a[j][i])/2
            b[i][j]=x
            b[j][i]=x
            c[i][j]=a[i][j]-x
            c[j][i]=a[j][i]-x
for i in b:
    for j in i:
        print("{0:.8f}".format(j),end=" ")
    print()    
        
for i in c:
    for j in i:
        print("{0:.8f}".format(j),end=" ")
    print()    