For this Question: Given N coordinates on a two dimensional plane. Find the area of the smallest rectangle such that all the points can lie inside or on the rectangle boundary.
Note - the sides of rectangle should be parallel to x and y axis.First line of input contains N.
Next N lines contains two integers x[i] and y[i].

Constraints:
2 <= N <= 100000
0 <= x[i], y[i] <= 1000000000

Note the required rectangle will never have 0 area.Print the area of the smallest rectangle such that all the points can lie inside or on the rectangle the boundary.Sample Input
2
0 0
1 1

Sample Output
1

Explanation: required rectangle has corners at (0, 0) (0, 1) (1, 1) (1, 0), I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

		int N = Integer.parseInt(reader.readLine());
		int minX = Integer.MAX_VALUE, maxX = Integer.MIN_VALUE;
		int minY = Integer.MAX_VALUE, maxY = Integer.MIN_VALUE;


		for(int i = 0; i < N; i++) {
			StringTokenizer tokens = new StringTokenizer(reader.readLine());
			int x = Integer.parseInt(tokens.nextToken());
			int y = Integer.parseInt(tokens.nextToken());

			minX = Math.min(minX, x);
			maxX = Math.max(maxX, x);

			minY = Math.min(minY, y);
			maxY = Math.max(maxY, y);
		}


		long X = maxX - minX;
		long Y = maxY - minY;
		long area = X * Y;

		System.out.println(X * Y);

		reader.close();
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?