Three friends Navneet, Gaurav and Rishab want to play with a frisbee. As its a rainy season the ground is wet and muddy. So, Navneet picked N good spots (with integer coordinates) where each of them can stand and play (one person on one spot).

Gaurav being a great Mathematician wants to know the maximum possible area of a triangle that can be formed from those N spots, such that each of the three vertices of that triangle must be a part of at least one right-angled-triangle formed from those N spots. As he is busy playing frisbee so, he asked you for help. Note that those three vertices may be a part of same or different right-angled-triangles (i.e. if $\triangle ABC$ is the triangle with the maximum area then vertices $A, B, C$ must be a part of atleast one right-triangle but it is not compulsory that they must be a part of  same right-triangle and $\triangle ABC$ may or may not be a right-triangle).

It is guaranteed that the solution exists.

Input:

First line contains the integer N. 
Each of the next N lines contains two space-seperated integers x, y 
denoting the point (x,y)

Constraints:

$1 \leq N \leq 2000\\ 1\leq x \leq 4\\ 1 \leq y \leq 10^9$

Output:

If P is you answer then output a single line containing the number 2*P.