codeforces Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) C. Constellation

C. Constellation

Cat Noku has obtained a map of the night sky. On this map, he found a constellation with n stars numbered from 1 to n. For each i, thei-th star is located at coordinates (xi, yi). No two stars are located at the same position.

In the evening Noku is going to take a look at the night sky. He would like to find three distinct stars and form a triangle. The triangle must have positive area. In addition, all other stars must lie strictly outside of this triangle. He is having trouble finding the answer and would like your help. Your job is to find the indices of three stars that would form a triangle that satisfies all the conditions.

It is guaranteed that there is no line such that all stars lie on that line. It can be proven that if the previous condition is satisfied, there exists a solution to this problem.

Input

The first line of the input contains a single integer n (3 ≤ n ≤ 100 000).

Each of the next n lines contains two integers xi and yi ( - 109 ≤ xi, yi ≤ 109).

It is guaranteed that no two stars lie at the same point, and there does not exist a line such that all stars lie on that line.

Output

Print three distinct integers on a single line — the indices of the three points that form a triangle that satisfies the conditions stated in the problem.

If there are multiple possible answers, you may print any of them.

Sample test(s)

input

3
0 1
1 0
1 1

output

1 2 3

input

5
0 0
0 2
2 0
2 2
1 1

output

1 3 5

Note

In the first sample, we can print the three indices in any order.

In the second sample, we have the following picture.

Note that the triangle formed by starts 1, 4 and 3 doesn't satisfy the conditions stated in the problem, as point 5 is not strictly outside of this triangle (it lies on it's border).

/*先排序,然后判断相邻三个点不共线就行了*/
#include<cstdio>
#include<cstring>
#include<map>
#include<stack>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
struct point
{
    int id;
    int x,y;
}p[maxn];
bool cmp(point a,point b)
{
    return a.x==b.x?a.y<b.y:a.x<b.x;
}
bool check(point a,point b,point c)
{
    if((a.y-b.y)*1.0/(a.x-b.x)==(b.y-c.y)*1.0/(b.x-c.x))return false;
    return true;
}
int main()
{
    int n,i;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf("%d%d",&p[i].x,&p[i].y),p[i].id=i+1;
    sort(p,p+n,cmp);
    for(i=2;i<n;i++)
        if(check(p[i],p[i-1],p[i-2]))break;
    printf("%d %d %d
",p[i-2].id,p[i-1].id,p[i].id);
    return 0;
}