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).
if __name__ == '__main__':
    n = int(input())
    w = []
    for i in range(n):
        w.append(list(map(int, input().split())))
    a=[]
    b=[]
    for i in range(n):
        a.append([0.0]*n)
        b.append([0.0]*n)
    for i in range(n):
        for j in range(i, n):
            a[i][j] = (w[i][j] + w[j][i]) / 2
            a[j][i] = a[i][j]
            b[i][j] = w[i][j] - a[i][j]
            b[j][i] = w[j][i] - a[j][i]
    for i in range(n):
        print(" ".join(list(map(str, a[i]))))
    for i in range(n):
        print(" ".join(list(map(str, b[i]))))
