#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+7;

struct Point{
	int x,y;
}p[N];

int n;

signed main(){
	srand(time(0));
	while(scanf("%d",&n)!=EOF){
		for(int i=1;i<=n;++i){
			scanf("%d%d",&p[i].x,&p[i].y);
		}
		int mx=2,ans=n; //最大链长度 
		for(int t=1;t<=500;++t){ 
			int A=rand()%n+1,B=rand()%n+1;
			while(A==B) A=rand()%n+1,B=rand()%n+1;
			int sum=2;
			for(int C=1;C<=n;++C){
				if(A==C||B==C) continue;
				if((p[C].y-p[B].y)*(p[B].x-p[A].x)==(p[C].x-p[B].x)*(p[B].y-p[A].y)){
					++sum;
				}
				if(2*n>3*sum) ans=min(ans,n%3);
				mx=max(mx,sum);
			}
		}
		ans=min(ans,mx-2*(n-mx));
		printf("%d\n",ans);
	}
	return 0;
}
/*
3
0 0
0 1
0 2
3
0 0
0 1
1 0
6
0 0
0 1
0 2
0 3
1 1
1 2

*/