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())
l=[]
for i in range(n):
    l.append(list(map(float,input().split())))
a,b=[],[]
for i in range(n):
    d=[]
    for j in range(n):
        d.append(0.0)
    a.append(d)
for i in range(n):
    for j in range(n):
        x=l[i][j]+l[j][i]
        a[i][j]=x/2
        a[j][i]=x/2
for i in range(n):
    print(*a[i])
for i in range(n):
    d=[]
    for j in range(n):
        d.append(0.0)
    b.append(d)
for i in range(n):
    for j in range(n):
        b[i][j]=l[i][j]-a[i][j]
        b[j][i]=l[j][i]-a[j][i]
for i in range(n):
    print(*b[i])
