#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

struct Pt
{
	int x, y;
	Pt operator-(const Pt& p) const
	{
		return {x - p.x, y - p.y};
	}
};

LL cross(const Pt& p, const Pt& q)
{
	return (LL)p.x * q.y - (LL)p.y * q.x;
}

mt19937 rng;

int n;

void solve()
{
	vector<Pt> v(n);
	for (Pt& p : v)
		cin >> p.x >> p.y;
	const int MAGIC = 74;
	int m = 1;
	FOR(i, 0, MAGIC)
	{
		int i1 = rng() % n, i2 = rng() % n;
		if (i1 == i2)
			continue;
		Pt p1 = v[i1], p2 = v[i2];
		int cur = 0;
		for (const Pt& p : v)
		{
			if (cross(p - p1, p - p2) == 0)
			{
				cur++;
			}
		}
		assert(cur >= 2);
		m = max(m, cur);
	}
	int ans = n - 3 * (n - m);
	if (ans < 0)
	{
		ans = n % 3;
	}
	cout << ans << "\n";
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	while (cin >> n)
		solve();
	return 0;
}