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: 

minx = 1000000000
maxx= 0
miny=1000000000
maxy=0
n = int(input())
while(n): 
	a,b = map(int,input().split())
	minx = min(minx,a);
	maxx = max(maxx,a);
	miny = min(miny,b);
	maxy = max(maxy,b);
	n -=1
	
l = (maxx-minx);
b = (maxy-miny);
print(l*b), In this Programming Language: Python, Now tell me if this Code is compilable or not?