#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define int long long
#define mod 998244353
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int tx[200005],ty[200005];
signed main()
{
	int n,x,y,sl;
	bool flag;
	srand(time(0));
	while(cin>>n)
	{
		for(int i=1;i<=n;i++)
		{
			tx[i]=read();
			ty[i]=read();
		}
		if(n==1)
		{
			printf("1\n");
			continue;
		}
		flag=false;
		for(int i=1;i<=8;i++)
		{
			x=1LL*rand()*rand()%n+1;
			y=1LL*rand()*rand()%n+1;
			while(y==x)y=1LL*rand()*rand()%n+1;
			sl=0;
			for(int j=1;j<=n;j++)
			{
				if((tx[x]-tx[y])*(ty[j]-ty[x])-(ty[x]-ty[y])*(tx[j]-tx[x])==0)
				{
					sl++;
				}
			}
			if(sl>2*(n-sl))
			{
				//printf("%lld %lld\n",x,y);
				printf("%lld\n",sl*3-2*n);
				flag=true;
				break;
			}
		}
		if(flag==false)printf("%lld\n",n%3);
	}
}