#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("infasuratoare.in");
ofstream cout("infasuratoare.out");
struct ura{
    double x,y;
    int p;
}v[120001];
int stiva[120001];
int n;
bool cmp(ura a,ura b){
    if(a.x==b.x)
        return a.y<b.y;
    else
        return a.x<b.x;
}
int main()
{
    int i,vf;
    cin>>n;
    for(i=1;i<=n;i++){
        cin>>v[i].x>>v[i].y;
    }
    sort(v+1,v+n+1,cmp);
    for(i=2;i<n;i++){
        if(v[1].x*v[n].y+v[n].x*v[i].y+v[i].x*v[1].y<v[1].y*v[n].x+v[n].y*v[i].x+v[i].y*v[1].x)
            v[i].p=1;
        else
            v[i].p=-1;
    }
    stiva[1]=1;
    vf=0;
    i=2;
    while(vf==0){
        if(v[i].p==1)
            vf=2,stiva[vf]=i;
        i++;
    }
    for(i=i;i<=n;i++){

    }
    return 0;
}