#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2e5+5;

int n;
struct pt
{
    int x,y;
}p[MAXN];

int gcd(int x, int y)
{
    if(!y) return x;
    return gcd(y, x % y);
}

void solve()
{
    for(int i = 1; i <= n; ++i) cin >> p[i].x >> p[i].y;
    random_shuffle(p+1, p+1+n);
    int k = 1;
    for(int i = 1; i <= min(20,n); ++i)
    {
        map<pair<int,int>, int> mp;
        for(int j = 1; j <= n; ++j) if(j != i)
        {
            int dx = p[j].x - p[i].x, dy = p[j].y - p[i].y;
            int g = gcd(abs(dx), abs(dy));
            //printf("g=%d\n",g);
            dx = dx / g; dy = dy / g;
            if(dx < 0) dx = -dx, dy = -dy;
            mp[{dx, dy}]++;
        }
        for(auto t : mp)
        {
            k = max(k, t.second+1);
        }
    }
    //printf("k=%d\n",k);
    int ans;
    if(n-k >= k/2)
    {
        ans = n % 3;
    }
    else
    {
        ans = k - 2 * (n-k);
    }
    cout << ans << endl;
}

int main()
{
    while(cin >> n)
    {
        solve();
    }
    return 0;
}