#include<bits/stdc++.h>
using namespace std;
int n;
#define ll long long
struct no{
    ll x,y;
    no(){x=0,y=0;}
    no(ll x_,ll y_){x=x_,y=y_;}
}a[200100];
no operator - (const no &a,const no &b) {return no(a.x-b.x,a.y-b.y);}
ll sat(no a,no b){return a.x*b.y-a.y*b.x;}
mt19937 rnd(time(0));
int u,v;
void mk(){
    u=rnd()%n+1,v=rnd()%n+1;
    while(u==v)u=rnd()%n+1,v=rnd()%n+1;
}
int D;
void sol(){
    if(n<=2){printf("%d\n",n);return;}
    for(int i=1;i<=n;i++)scanf("%lld%lld",&a[i].x,&a[i].y);
    int step=100;
    D=0;
    while(step--){
        mk();int su=0;
        for(int i=1;i<=n;i++)
            if(sat(a[i]-a[u],a[i]-a[v])==0)su++;
        D=max(D,su);
    }
    printf("%d\n",n-min(n/3,n-D)*3);
}
int main(){
    while(~scanf("%d",&n))sol();
    return 0;
}