Two Rectangles

You are given $N$ points in the plane. Cover all of them with two axis-parallel rectangles, and make the area of the larger rectangle as small as you can.

The two rectangles must not overlap. Touching along an edge or at a corner is allowed. The two rectangles do not have to be the same shape or the same size. A rectangle may have width or height $0$, and then its area is $0$.

Every point has to lie inside one of the two rectangles or on its boundary.

The arrangement in the picture is not an answer, because the larger rectangle can still be shrunk. The $20$ points drawn there are the second block of the first test case below.

Input arrives on standard input. The first line holds the number of test cases $T$ ($1 \le T \le 20$).

Each test case starts with a line holding the number of points $N$ ($1 \le N \le 10000$). The next $N$ lines each hold the coordinates of one point as two integers. Every coordinate is an integer between $-30000$ and $30000$. The same point may be given more than once.

Write to standard output. For each test case, print on its own line the area of the larger of the two rectangles, minimized.