Mines#1666
UN peacekeepers in one of the world's hotspots neutralized a minefield as follows: given a map where each mine is specified by its Cartesian coordinates, and given that no three mines are collinear, they stretched a special cord between the mines so as to form a convex polygon of minimal perimeter, with all other mines inside this polygon. After neutralizing the mines on the polygon, they repeated the process for the remaining mines and continued as long as it was possible according to the rules.
How many mines remain unneutralized, and how many times did the sappers have to stretch the cord?
The first line contains an integer (3 \leq N \leq 1000) — the number of mines. The second line contains integers ( pairs x_i, y_i), the coordinates of each mine (-32000 \leq x_i, y_i \leq 32000).
Print two integers separated by a space: the number of mines remaining and the number of cord stretching operations.
Example 1