Problem Setter: Anubrata Das Sarma

During all his travels across the galaxy, Jadoo has met many strange and advanced civilizations. One such civilization of beings more advanced than the humans were trying to create a megastructure that would connect some of the outer planets in their star system to build the smallest possible convex polygon.

Given a set of points on a 2d plane representing the position of the planets, find the coordinates of the planets which are part of the smallest convex polygon that contains all the points solution. If there are more than one leftmost points, then consider the point with maximum y-coordinate as the leftmost point.

Input Format:

• The first line of input consists of an integer n.
• The next n lines each consist of two integers x and y.

Constrains:

• Value of n is 0 to 10^3
• Value of x and y is -10^3 to 10^3

Output Format: The output should consist of the coordinates of the smallest convex polygon in anticlockwise order from the leftmost point.