#include<bits/stdc++.h>
using namespace std;

inline int read()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0' || c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0' && c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}

const int N=2e5+5;
int n;
int x[N],y[N];

inline bool check(int i,int j,int k)
{
	return 1LL*(y[j]-y[i])*(x[k]-x[j])==1LL*(y[k]-y[j])*(x[j]-x[i]);
}
inline int random(int l,int r)
{
	return 1LL*rand()*rand()%(r-l+1)+l;
}

int main()
{
	srand(time(0));
	while(cin>>n)
	{
		for(int i=1;i<=n;i++) x[i]=read(), y[i]=read();
		if(n<=20)
		{
			int c1=0;
			for(int i=1;i<=n;i++)
				for(int j=i+1;j<=n;j++)
				{
					int cnt=2;
					for(int k=1;k<=n;k++)
					{
						if(k==i || k==j) continue;
						if(check(i,j,k)) cnt++;
					}
					c1=max(c1,cnt);
				}
			int c2=n-c1;
			if(c1>=c2*2) printf("%d\n",n-3*c2);
			else printf("%d\n",n%3);
			continue;
		}
		int c1=0;
		for(int i=1;i<=50;i++)
		{
			int p1=random(1,n);
			int p2=random(1,n);
			if(p1==p2) continue;
			int cnt=2;
			for(int k=1;k<=n;k++)
				{
					if(k==p1 || k==p2) continue;
					if(check(p1,p2,k)) cnt++;
				}
			c1=max(c1,cnt);
		}
		int c2=n-c1;
		if(c1>=c2*2) printf("%d\n",n-3*c2);
		else printf("%d\n",n%3);
	}
	return 0;
}