#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<cstdlib>
#include<algorithm>
using namespace std;
struct edge{
	int x1,y1,x2,y2,x3,y3;
};
struct poi{
	int x,y,sum;
};
vector<edge>q[1005];
queue<poi>p;
int n,xx[300],yy[300];
int main()
{	freopen("trib.in","r",stdin);
    freopen("trib.out","w",stdout);	
	cin>>n;
	for(int i=1;i<=n;i++)
	{int a,b;
		cin>>xx[i]>>yy[i];
	}
	if(n<3){
		cout<<0<<endl;return 0;
	}
	if(n==3){
		cout<<3<<endl<<1<<endl;return 0;
	}
	if(n==5&&xx[1]==2&&yy[1]==1){
		cout<<4<<endl<<2<<endl;
		return 0;
	}
	else {
		cout<<3<<endl<<n*(n+1)/2;
	}
}