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())
w = [None]*n
dsum_len = 2*n-1
dsum = [0]*dsum_len
for i in range(n):
    w[i] = [int(j) for j in input().strip().split(' ')]
    for j in range(n):
        dsum[i+j] += w[i][j]
        
for i in range(n):
    for j in range(n):
        val = w[i][j]
        if (i != j):
            ij = i+j
            if ij >= n:
                val = dsum[ij]/(dsum_len-ij+1)
            else:
                val = dsum[ij]/(ij+1)
        print('{:.8f}'.format(val), end=' ')
    print('')

for i in range(n):
    for j in range(n):
        val = 0
        if (i != j):
            ij = i+j
            if ij >= n:
                val = w[i][j]-(dsum[ij]/(dsum_len-ij+1))
            else:
                val = w[i][j]-(dsum[ij]/(ij+1))
        print('{:.8f}'.format(val), end=' ')
    print('')
