#include<bits/stdc++.h>
#define MAXN 310
using namespace std;
struct Point{
	int x,y;
}p[MAXN];
struct Vec{
	int x,y;
};
int Cross(Vec a,Vec b){return a.x*b.y-b.x*a.y;}
bool Judge(Point a,Point b,Point c,Point d){//检查d是否在a,b,c三点围成的三角形内 
	Vec x=(Vec){a.x-b.x,a.y-b.y};
	Vec y=(Vec){c.x-a.x,c.y-a.y};
	Vec z=(Vec){b.x-c.x,b.y-c.y};
	Vec temp1=(Vec){d.x-b.x,d.y-b.y};
	Vec temp2=(Vec){d.x-a.x,d.y-a.y};
	Vec temp3=(Vec){d.x-c.x,d.y-c.y};
	int num1=Cross(x,temp1),num2=Cross(y,temp2),num3=Cross(z,temp3);
	int temp=0;
	if(num1<0)temp++;
	if(num2<0)temp++;
	if(num3<0)temp++;
	return (temp==0||temp==3);
}
int N,ans1,ans2,temp;
int main(){
	freopen("trib.in","r",stdin);
	freopen("trib.out","w",stdout);
	scanf("%d",&N);
	for(int i=1;i<=N;i++){scanf("%d%d",&p[i].x,&p[i].y);} 
	for(int i=1;i<=N;i++){
		for(int j=i+1;j<=N;j++){
			for(int k=j+1;k<=N;k++){
				temp=0;
				for(int m=1;m<=N;m++){
					if(m!=i&&m!=j&&m!=k){
						if(Judge(p[i],p[j],p[k],p[m])){
							temp++;
						}
					}
				}
				if(temp>ans1)ans1=temp,ans2=1;
				else if(temp==ans1)ans2++;
			}
		}
	}
	printf("%d\n%d",ans1+3,ans2);
	return 0;
}