#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
struct poi{
	int x,y;
	bool operator == (const poi t)const{
		return (t.x==x&&t.y==y);
	}
}p[310],s[310];
struct hhh{
	int x,y,z;
	bool operator == (const hhh t)const{
		return (t.x==x&&t.y==y&&t.z==z);
	}
}a[310];
void pre(hhh &w){
	int t;
	if(w.x>w.y)t=w.y,w.y=w.x,w.x=t;
	if(w.x>w.z)t=w.z,w.z=w.x,w.x=t;
	if(w.y>w.z)t=w.z,w.z=w.y,w.y=t;
}
int n,m,ans=0,tot=0;
double Cross(poi a,poi b,poi c){
	return (a.x-c.x)*(b.y-c.y)-(a.y-c.y)*(b.x-c.x);
}
double Dis(poi a,poi b){
	return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
bool cmp(poi a,poi b){
	if(Cross(a,b,p[1])>=0)return true;
	else if(Cross(a,b,p[1])==0&&Dis(a,p[1])<Dis(b,p[1]))return true;
	else return false;
}
double Area(poi a,poi b,poi c){
	double area=a.x*(b.y-c.y)+b.x*(c.y-a.y)+c.x*(a.y-b.y);
	return fabs(area);
}
bool check(poi a,poi b,poi c,poi d,double k){
	double q=Area(a,d,b)+Area(b,d,c)+Area(a,d,c);
	if(q==k)return true;
	else return false;
}
void work(){
	int num,w,h;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(j==i)continue;
			for(int k=i;k<=n;k++){
				if(k==j||k==i)continue;
				num=3;
				double kq=Area(p[i],p[j],p[k]);
				for(int q=1;q<=n;q++){
					if(p[q]==p[i]||p[q]==p[k]||p[q]==p[j])continue;
					if(check(p[i],p[k],p[j],p[q],kq))num++;
				}
				if(num>ans)ans=num,tot=0;
				if(num==ans)tot++,a[tot].x=i,a[tot].y=j,a[tot].z=k;
			}
		}
	}
}
int main(){
	freopen("trib.in","r",stdin);
	freopen("trib.out","w",stdout);
	scanf("%d",&n);
	int k=1;
	for(int i=1;i<=n;i++){
		scanf("%d%d",&p[i].x,&p[i].y);
		if(p[k].x>p[i].x||(p[k].x==p[i].x)&&(p[k].y>p[i].y))k=i;
	}
	swap(p[1],p[k]);
	work();
	int yyp=tot;
	for(int i=1;i<=tot;i++)pre(a[i]);
	for(int i=1;i<tot;i++){
		for(int j=i+1;j<=tot;j++){
			if(a[i]==a[j]&&(a[i].x!=-1001&&a[i].y!=-1001&&a[i].z!=-1001))yyp--,a[j].x=-1001,a[j].y=-1001,a[j].z=-1001;
		}
	}
	printf("%d\n%d\n",ans,yyp);
	return 0;
}