Mailing Origami

You want to mail a piece of origami you folded to your mom.

The postage depends on the area of the envelope: the smaller the envelope, the cheaper the shipment. You cannot fold the origami again to make it smaller, and the envelope has to be rectangular. The envelope may be turned to any angle, so its sides do not have to be parallel to the coordinate axes.

The outline of the origami is given as $N$ vertices listed in order along its boundary, and the boundary may fold back over itself. Find the area of the smallest rectangular envelope that contains the origami.

The first line contains the integer $N$, the number of vertices of the origami ($3 \le N \le 100000$).

Each of the next $N$ lines contains two integers $x$ and $y$, the coordinates of one vertex ($0 \le x \le 10^7$, $0 \le y \le 10^7$). All vertices are distinct, and no single line contains all of them.

Print the area of the smallest envelope that contains the origami, rounded to the nearest integer. No input has a smallest envelope whose area has a fractional part between 0.49 and 0.51.