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())
h=[]

for i in range(n):
    g=[int(r) for r in input().split()]
    h.append(g)
    
b=[]
for i in range(n):
    b.append([0]*n)
    
s=[]
for i in range(n):
    s.append([0]*n)
t=[]
for i in range(n):
    t.append([0]*n)
for i in range(n):
    for j in range(n):
        b[i][j]=h[j][i]
for i in range(n):
    for j in range(n):
        s[i][j]=(b[i][j]+h[i][j])/2
for i in range(n):
    for j in range(n):
        t[i][j]=(h[i][j]-b[i][j])/2

for i in s:
    print('\n')
    for j in i:
        print(j,end=' ')
        
for i in t:
    print('\n')
    for j in i:
        print(j,end=' ')