Write Java code for problem below $($Should not have plagerism$)$

B$.$ Convex Hull

Given a set of $n$ distinct points on the $2$D plane, output their convex hull.

Input

The first line of input has an integer $n(1n200,000)$ : the number

of points.

$n$ lines follow, the $i-$th of which contains two integers $x_i$ and $y_i($

$-{10}^9{x}_i,y_i{10}^9)$: the coordinates of the $i-$th input point.

All points are distinct, and the input is such that the area of the convex hull is positive.

Output

First print an integer $k$ : the number of points in the convex hull.

Then print $k$ lines that describe the points. The points can be printed in

any order.

For Sample Input and Output Image is attached

Print every point which lies on the convex hull, i$.$e$,$ if some points on the hull are collinear, print all of them $($see second sample case for an

example$)$

Write Java code for problem above $($Should not have plagerism$)$