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=[[] for i in range(n)]
arr1=[[None for i in range(n)] for i in range(n)]
arr2=[[None for i in range(n)] for i in range(n)]
for i in range(n):
    x=[int(x) for x in input().split()]
    for item in x:
        a[i].append(item)
for i in range(n):
    for j in range(n):
        arr1[i][j]=(float(a[i][j]+a[j][i]))/2
        arr2[i][j]=(float(a[i][j]-a[j][i]))/2
for i in range(n):
    print(*arr1[i])
for i in range(n):
    print(*arr2[i])
        