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 = []
def print_matrix(A):
    for i in A:
        for j in i:
            print(j,end=' ')
        print()
for i in range(n):
    row_input = input()
    row_list = row_input.split()
    new_row_list = []
    for j in row_list:
        new_row_list.append(float(j))
    W.append(new_row_list)
print_matrix(W)

a = [row[:] for row in W]
b = [row[:] for row in W]

for j in range(n):
    for i in range(n):
        if i == j: continue
        a[j][i] = (W[j][i] + W[i][j]) / 2.0
        b[j][i] = a[j][i] - W[j][i]
        #print(i,j,a[j][i],W[j][i],W[i][j])
print_matrix(a)
print_matrix(b)
