#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using db=double;
#define int long long
using pii=pair<int,int>;
#define endl "\n"
#define pb push_back
void solve(int n)
{
    vector<pii>pic;
    for(int i=0;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        pic.pb({x,y});
    }
    if(n<3) 
    {
        cout<<n<<endl;
        return;
    }
    int k = 2e3,ma = 0;
    while(k--){
        int p1 = rand()%n,p2 = rand()%n;
        while(p2 == p1)p2 = rand()%n;
        int x1=pic[p1].first-pic[p2].first;
        int y1=pic[p1].second-pic[p2].second;
        int res = 2;
        for(int i=0;i<n;i++)
        {
            if(i == p1||i == p2)continue;
            int x=pic[i].first-pic[p1].first;
            int y=pic[i].second-pic[p1].second;
            if(1ll*x*y1==1ll*y*x1)res++;
        }
        ma = max(ma,res);
    }
    int cn = min(ma/2,n-ma);
    cout<<n-cn*3<<endl;
}

signed main()
{
    #ifdef ONLINE_JUDGE
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    #endif
    int _=1;
    while(cin>>_) solve(_);
    return 0;
}