#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <random>
#include <ctime>
using namespace std;
typedef long long ll;
const int maxn = 2e6 + 10;
int n;
ll x[maxn],y[maxn];

int main() {
	mt19937 rnd(time(0));
	ios::sync_with_stdio( 0 );
	cin.tie( 0 );
	cout.tie( 0 );
	while(cin >> n){
		for(int i = 1;i<=n;i++){
			cin >> x[i] >> y[i];
		}
		int cnt = 100;
		int maxx = 0;
		while(cnt--){
			int a = rnd() % n + 1;
			int b = rnd() % n + 1;
			if(a == b)
				continue;
			int num = 0;
			for(int i = 1;i<=n;i++){
				if((x[i] - x[a]) * (y[i] - y[b]) - (x[i] - x[b]) * (y[i] - y[a]) == 0){
					num++;
				}
			}
			maxx = max(num,maxx);
		}
		if(maxx <= (n - n % 3) / 3 * 2){
			cout << n % 3 << "\n";
		}
		else {
			cout << n - 3 * (n - maxx) << "\n";
		}
	}
	return 0;
}