Triangle

There are N points on a plane.

Choose three of the given points that are not collinear to form a triangle. If a triangle contains as many of the given points as possible, it is called a super triangle. Points on an edge or at a vertex of the triangle are also counted as contained.

Find three given points that form a super triangle.

The first line contains N (3 ≤ N ≤ 300), the number of points.

Each of the next N lines contains the coordinates xi and yi of one point.

The input always contains at least one set of three points that are not collinear.

On the first line, print the number of given points contained in a super triangle.

On the second line, print the three point numbers that form that triangle, in any order.

If there is more than one valid answer, print any one of them.