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())
mat=[]
for i in range(n):
    l=list(map(int,input().split()))
    mat.append(l)
x=[[False]*n for i in range(n)]
y=[[False]*n for i in range(n)]
for i in range(n):
    for j in range(n):
        if x[i][j]==False:
            k=mat[i][j]+mat[j][i]
            x[i][j]=k/2
            x[j][i]=k/2
for i in range(n):
    for j in range(n):
        if y[i][j]==False:
            if mat[i][j]>x[i][j]:
                y[i][j]=-(x[i][j]-mat[i][j])
                y[j][i]=x[i][j]-mat[i][j]
            elif mat[i][j]==x[i][j]:
                y[i][j]=mat[i][j]-x[i][j]
                y[j][i]=mat[i][j]-x[i][j]
            else:
                y[i][j]=mat[i][j]-x[i][j]
                y[j][i]=-(mat[i][j]-x[i][j])
for i in range(n):
    for j in range(n):
        print('%.8f'%x[i][j],end=" ")
    print("")
for i in range(n):
    for j in range(n):
        print('%.8f'%y[i][j],end=" ")
    print("")
