#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (222222)
struct pt{
    double x,y;
    int I;
    pt operator-(pt r){return {x-r.x,y-r.y};}
    pt operator+(pt r){return {x+r.x,y+r.y};}
    pt operator*(double a){return {x*a,y*a};}
    bool operator<(const pt&r)const{return EQ(x,r.x)?y<r.y:x<r.x;}//< by X
    bool operator==(const pt&r)const{return EQ(x,r.x)&&EQ(y,r.y);};
    double dst(pt r={0,0}){return sqrt((x-r.x)*(x-r.x)+(y-r.y)*(y-r.y));}
    double XP(pt b){return x*b.y-y*b.x;}
    double DT(pt b){return x*b.x+y*b.y;}
    double AG(){return atan2(x,y);}
    bool gt(){return ~scanf("%lf%lf",&x,&y);}
    void prt(){printf("%.3lf %.3lf\n",x,y);}
}p[MX],P[MX],r[MX],R[MX],t[9];
double XX(pt a,pt b,pt c){return (a.x-c.x)*(b.y-c.y)-(b.x-c.x)*(a.y-c.y);}
bool cp(pt a,pt b){return EQ(a.y,b.y)?a.x<b.x:a.y<b.y;}//< by Y
int hull(pt*P,int N,pt*r){
	if(N==1)return *r=*P,1;
    sort(P,P+N);
    int M(0),K;
    F(N){
        while(M>1&&(r[M-1]-r[M-2]).XP(P[i]-r[M-2])<0)--M;
        r[M++]=P[i];
    }K=M;
    for(int i(N-2);~i;--i){
        while(M>K&&(r[M-1]-r[M-2]).XP(P[i]-r[M-2])<0)--M;
        r[M++]=P[i];
    }
    return max(M-1,0);
}
#define AG(I,J) atan2(P[I].x-P[J].x,P[I].y-P[J].y)
#define SS(A) (EQ(A,0)?0:A<0?-1:1)
int N,M,I,S,C[MX],L;
set<int> G;
vi Z;
pair<double,int> V[MX*2];
int go(){
    FT(1,M)V[L++]={AG(R[0].I,R[k].I),R[k].I};
    F(N)if(!G.count(i))V[L++]={AG(R[0].I,i),i};
    sort(V,V+L);
    F(L)V[i+L]=V[i];
    int l=-1,y=0;
    F(L*2)if(G.count(V[i].bb))l=V[i].bb,C[V[i].bb]|=y,y=0;
          else{
              y=1;
              if(~l)C[l]=1;
          }
    S=N-M+1;
    F(N)S+=C[i];
    return S;
}
int main(void){
    scanf("%d",&N);
    F(N)p[i].gt(),p[i].I=i,P[i]=p[i];
    M=hull(p,N,r);
    assert(N>=M);
    if(N==M)return printf("3 %d %d\n",N-2,N),0;
    F(M)if(r[i].I<r[I].I)I=i;
    F(M)R[i]=r[(i+I)%M],G.insert(R[i].I);
    printf("4 %d %d\n",N-M,go());
    return 0;
}