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

const int maxn=2e5+5;
int n, m, x[maxn], y[maxn];

int randint(int x){
	return rand()%x;
}
int gcd(int x, int y){
	return y==0?x:gcd(y, x%y);
}
pair<int, int> slope(int i, int j){
	int dx=x[i]-x[j], dy=y[i]-y[j];
	if (dx<0) dx=-dx, dy=-dy;
	if (dx==0&&dy<0) dy=-dy;
	int g=gcd(dx, dy);
	return make_pair(dx/g, dy/g);
}
map<pair<int, int>, int> ma;

int main(){
	srand(time(NULL));
	while (~scanf("%d", &n)){
		m=0;
		for (int i=0; i<n; ++i)
			scanf("%d%d", &x[i], &y[i]);
		int p, maxm, t;
		pair<int, int> maxs, tmp;
		for (int I=0; I<20; ++I){
			p=randint(n);
			maxm=0;
			ma.clear();
			for (int i=0; i<n; ++i){
				if (i==p) continue;
				tmp=slope(p, i);
				t=++ma[tmp];
				if (t>maxm){
					maxm=t;
					maxs=tmp;
				}
			}
			int cnt=1;
			for (int i=0; i<n; ++i){
				if (i==p) continue;
				if (slope(p, i)==maxs) ++cnt;
			}
			m=max(m, cnt);
		}
		if (m<=2*n/3){
			printf("%d\n", n%3);
			continue;
		}
		printf("%d\n", 3*m-2*n);
	}
	return 0;
}