trokut

문제

There are N different points in a plane. 

We say that the triangle formed by some three points as corners is a super-triangle if the number of points inside this triangle is as large as possible. We consider the points in the corners or on the sides of the triangle as being inside the triangle. 

Write a program that will, among given points, find three points that form some super-triangle. 

입력

The first line of input contains an integer N, 3 ≤ N ≤ 300. 

Each of the following N lines contains two integers – the coordinates of one point. 

Note: the test data will be such that there will be at least three non-collinear points. 

출력

The first line of output should contain the number of points inside the super-triangle. 

The second line should contain three numbers – indices of the three corner points of the super-triangle, in any order.