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).
def transpose(m, d):
    new = []
    for i in range(d):
        new.append([m[j][i] for j in range(d)])
    return new

def sum(a,b, dim):
    new = []
    for i in range(dim):
        new.append([(a[i][j]+b[i][j])/2 for j in range(dim)])
    return new
    
def diff(a,b, dim):
    new = []
    for i in range(dim):
        new.append([(a[i][j]-b[i][j])/2 for j in range(dim)])
    return new
            
def print_matrix(a,dim):
    for i in range(dim):
        row = ''
        for j in range(dim):
            row+= str(a[i][j])
            row+=' '
        print(row)

dim = int(input())
w = []
for _ in range(dim):
    w.append([int(i) for i in input().split()])
wt = transpose(w, dim)
print_matrix(sum(w, wt, dim), dim)
print_matrix(diff(w,wt,dim), dim)
