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())
mat = []
mat1 = []
mat2 = []
for _ in range(n):
    t = list(map(int, input().split()))
    mat.append(t)
for i in range(n):
    m = []
    m1 = []
    for j in range(n):
        if(i==j):
            m.append("{0:.8f}".format(mat[i][j]))
            m1.append("{0:.8f}".format(0))
        elif(i<j):
            a = (mat[i][j] + mat[j][i])/2
            m.append("{0:.8f}".format(a))
            m1.append("{0:.8f}".format(mat[i][j] - a))
        else:
            m.append(mat1[j][i])
            if(mat2[j][i][0] != "-"):
                m1.append("-"+(mat2[j][i]))
            else:
                m1.append(mat2[j][i][1:])
    mat1.append(m)
    mat2.append(m1)
for i in range(n):
    for j in range(n):
        print(mat1[i][j],end=" ")
    print()
for i in range(n):
    for j in range(n):
        print(mat2[i][j],end=" ")
    print()