FJ is unfortunately on a tight budget due to low milk production last quarter. He would therefore like to build an even smaller fenced enclosure if possible, and he is willing to sell one cow from his herd to make this possible.

Please help FJ compute the smallest possible area he can enclose with his fence after removing one cow from his herd (and thereafter building the tightest enclosing fence for the remaining N−1N−1 cows).

For this problem, please treat cows as points and the fence as a collection of four line segments (i.e., don't think of the cows as "unit squares"). Note that the answer can be zero, for example if all remaining cows end up standing in a common vertical or horizontal line. Finally, note that since NN can be quite large, you may need to be careful in how you solve this problem to make sure your program runs quickly enough!