#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<set> 
#define ll long long
#define lowbit(x) x&(-x)
#define mp make_pair
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
#define forE(i,x) for(int i=head[x];i;i=nxt[i])
#define pii pair<ll,int>
#define fi first
#define se second
using namespace std;
const int maxn=5e5+5;
const int mod=998244353;
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;
}
int n;
pii p[maxn];
int cross(pii x,pii y)
{
    return x.first*y.second-x.second*y.first;
}
signed main()
{
    srand(time(0));
    while(scanf("%lld",&n) != EOF)
    {
        rep(i,1,n) {p[i]={read(),read()};}
        if(n==1||n==2) {printf("%lld\n",n);continue;}
        int T=100,ans=n;
        while(T--)
        {
            int cnt=2;
            int x=rand()%n+1,y=rand()%n+1;
            while(x==y) x=rand()%n+1,y=rand()%n+1;
            pii v = {p[x].first-p[y].first,p[x].second-p[y].second};
            rep(i,1,n)
            {
                if(i==x||i==y) continue;
                pii u = {p[i].first-p[y].first,p[i].second-p[y].second};
                if(cross(u,v) == 0) cnt++; 
            }
            ans=min(ans,max(0,cnt-(2*(n-cnt))));
        }
        printf("%lld\n",ans);
    }
}