Largest and Smallest Triangle

There are $n$ points on the plane. Any three of them span a triangle. Find the area of the largest such triangle and the area of the smallest one. If the three chosen points lie on a single line, the area of that triangle counts as $0$.

The input holds several test cases. The first line of each test case has the number of points $n$ ($3 \le n \le 2000$). Each of the next $n$ lines has two integers $x$ and $y$ ($-10000 \le x, y \le 10000$), the coordinates of one point. No point appears twice inside one test case. The last line of the input holds a single $0$ and is not a test case.

For each test case print one line with two numbers: first the area of the smallest triangle, then the area of the largest triangle, separated by a space. Print both with exactly one digit after the decimal point. All coordinates are integers, so every area is a multiple of $0.5$ and one decimal digit is exact.