#include<algorithm>
#include<array>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<unordered_map>
#include<random>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define endl '\n'
using namespace std;
using ll=long long;
using db=double;
using pll=pair<ll,ll>;
const int inf=0x3f3f3f3f;
const int mod=998244353;
const int N=2e5+10,M=1e3+10;
pll p[N];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    random_device rd;
    mt19937 rng(rd());
    int n;
    while(cin >> n)
    {
        for(int i=0;i<n;i++)
        cin >> p[i].fi >> p[i].se;
        int t=500,ans=n;
        while(t--)
        {
            shuffle(p,p+n,rng);
            for(int i=2;i<n;i+=3)
            {
                int res=n%3;
                sort(p+i-2,p+i+1);
                if((p[i].fi-p[i-1].fi)*(p[i-1].se-p[i-2].se)==(p[i-1].fi-p[i-2].fi)*(p[i].se-p[i-1].se))
                    res+=3;
                ans=min(ans,res);
            }
        }
        cout << ans << endl;
    }
    return 0;
}