#include<cstdio>
#include<cmath>
#include<algorithm>
#define N 200006
#define eps 1e-7
int n;
struct Vector{
	int x,y;
	inline double atan2(){return ::atan2(y,x);}
	inline Vector operator - (const Vector &o){return (Vector){x-o.x,y-o.y};}
}a[N];
inline int check(int o){
	static double tmp[N];
	for(int i=1;i<=n;i++)if(i^o) tmp[i-(i>o)]=std::abs((a[i]-a[o]).atan2());
	std::sort(tmp+1,tmp+n);
	int ans=0;
	for(int now,i=1;i<n;i++){
		now=1;
		while(i+1<n&&std::abs(tmp[i]-tmp[i+1])<=eps) i++,now++;
		ans=std::max(ans,now);
	}
	return ans+1;
}
int main(){while(~scanf("%d",&n)){
	for(int i=1;i<=n;i++) scanf("%d%d",&a[i].x,&a[i].y);
	int o=(double)n*2/3,max;
	srand(822);
	int $=10;while($--)if((max=check(rand()%n+1))>o) goto FAIL;
	printf("%d\n",n%3);continue;
	FAIL:printf("%d\n",max-(n-max)*2);
}
	return 0;
}