Problem: 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: 

  * Aij = Aji, for all i, j (1 ≤ i, j ≤ n); 
  * Bij = - Bji, for all i, j (1 ≤ i, j ≤ n); 
  * Wij = Aij + Bij, for all i, j (1 ≤ i, j ≤ n). 



Can you solve the problem?

Input

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 Wij (0 ≤ |Wij| < 1717).

Output

The first n lines must contain matrix A. The next n lines must contain matrix B. Print the matrices in the format equal to format of matrix W in input. It is guaranteed that the answer exists. If there are multiple answers, you are allowed to print any of them.

The answer will be considered correct if the absolute or relative error doesn't exceed 10 - 4.

Examples

Input

2
1 4
3 2


Output

1.00000000 3.50000000
3.50000000 2.00000000
0.00000000 0.50000000
-0.50000000 0.00000000


Input

3
1 2 3
4 5 6
7 8 9


Output

1.00000000 3.00000000 5.00000000
3.00000000 5.00000000 7.00000000
5.00000000 7.00000000 9.00000000
0.00000000 -1.00000000 -2.00000000
1.00000000 0.00000000 -1.00000000
2.00000000 1.00000000 0.00000000

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;


public class Main implements Runnable {
		
	public void solve() throws IOException {
                int N = nextInt();
                int[][] w = new int[N][N];
                for(int i = 0; i < N; i++)
                        for(int j = 0; j < N; j++){
                                w[i][j] = nextInt();
                        }
                
                double[][] a = new double[N][N];
                double[][] b = new double[N][N];
                //solve comments
                /*
                Wij + Wji = Aij + Aji + Bij - Bji
                Wij + Wji = 2A [since Aij == Aji]
                (Wij + Wji) / 2 = A
                
                Literally, we have add the average
                so if Wij is less than AVG then ADD that to Bij
                else subtract that to Bij
                */
                for(int i = 0; i < N; i++){
                        for(int j = 0; j <= i; j++){
                                a[i][j] = a[j][i] = (w[i][j] + w[j][i]) / 2.0;
                        }
                }
                
                for(int i = 0; i < N; i++){
                        for(int j = 0; j < N; j++){
                                b[i][j] = w[i][j] - a[i][j];
                        }
                }
                
                
                for(int i = 0; i < N; i++){
                        for(int j = 0; j < N; j++){
                                out.print(a[i][j] + " ");
                        }
                        out.println();
                }
                
                for(int i = 0; i < N; i++){
                        for(int j = 0; j < N; j++){
                                out.print(b[i][j] + " ");
                        }
                        out.println();
                }
	}

	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	//-----------------------------------------------------------
	public static void main(String[] args) {
		new Main().run();
	}

        public void debug(Object... arr){
            System.out.println(Arrays.deepToString(arr));
        }

        public void print1Int(int[] a){
                for(int i = 0; i < a.length; i++)
                        System.out.print(a[i] + " ");
                System.out.println();
        }
        
        public void print2Int(int[][] a){
                for(int i = 0; i < a.length; i++){
                        for(int j = 0; j < a[0].length; j++){
                                System.out.print(a[i][j] + " ");
                        }
                        System.out.println();
                }
        }
        
	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
                        out = new PrintWriter(System.out);
			tok = null;
			solve();
			in.close();
                        out.close();
		} catch (IOException e) {
			System.exit(0);
		}
	}

	public String nextToken() throws IOException {
		while (tok == null || !tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}

	public int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	public long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	public double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
        PrintWriter out;
	BufferedReader in;
	StringTokenizer tok;
}