cf-618c

记住记住，看到1e9，要用longlong！！！

这个题一开始用园的方法，去判断，后来发现只需要随意的确定出两个点来，然后去找外的一个点，首先先排序，排序先看x后看y，然后去判断三点是否共线，高中知识啊，自己想了这么久~~哎~~

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, the i-th star is located at coordinates (x_i, y_i). 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 x_i and y_i ( - 10⁹ ≤ x_i, y_i ≤ 10⁹).

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.

Example

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

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <math.h>
#include <stack>
#define LL long long
using namespace std;
const int INF = 0x3f3f3f3f;
int dir[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};
const int maxn = 100000 + 10;
struct node
{
    LL id;
    LL x,y;
} p[maxn];
struct dir
{

    int a,b;
} k[maxn];
int cmp(struct dir a1,struct dir b1)
{
    return a1.a < b1.a;
}
int cmp1(struct node a1,struct node b1)
{
    if(a1.x != b1.x)
        return a1.x < b1.x;
    return a1.y < b1.y;
}
//int k[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i = 1; i <= n; i++)
    {
        scanf("%lld%lld",&p[i].x,&p[i].y);
        p[i].id = i;

    }
    sort(p + 1,p + 1 + n,cmp1);
    int t1;
    int cur = 3;
    while((p[1].x - p[2].x)*(p[1].y-p[cur].y) == (p[1].y-p[2].y)*(p[1].x-p[cur].x))
    {
        cur++;
    }
    printf("%lld %lld %lld\n",p[1].id,p[2].id,p[cur].id);
    return 0;
}