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())
array = [0]*n
for i in range(n):
    arr = input().split()
    arr = list(map(lambda x: int(x) if x.isdigit() else 0, arr))
    array[i] = arr
for i in range(n):
    for j in range(n):
        if(i == j):
            print(array[i][j],end=' ')
        else:
            print((array[i][j]+array[j][i])/2,end=' ')
    print('')
for i in range(n):
    for j in range(n):
        if(i == j):
            print('0',end=' ')
        else:
            if(i>j):
                print((array[i][j]-array[j][i])/2,end=' ')  
            else:
                print((array[i][j]-array[j][i])/2,end=' ')
    print('')