#include<bits/stdc++.h>
using namespace std;
#define int long long
int n ;
void solve() {
	vector<pair<int, int>> p(n + 1);
	for (int i = 1; i <= n; ++i)
	{
		int x, y;
		cin >> x >> y;
		p[i] = make_pair(x, y);
	}
	
	int tmp = 0;
	for (int kase = 0; kase < 60; kase++) {
		auto get = [&]() {
			return rand() % n + 1; 
		};
		int u = get();
		int v = get();
		if(u==v)continue;
//		cout << u << ' ' << v << '\n';
//		pair<int, int> line = [&](int u, int v) -> pair<int, int>{
//			return make_pair(p[u].first - p[v].first, p[u].second - p[v].second);
//		};
		
		auto dot = [](int x1, int y1, int x2, int y2) {
			return x1 * y2 - x2 * y1;	
		};
		
		auto online = [&](int u, int v, int w) -> bool {
			return 0 == dot(p[u].first - p[v].first, p[u].second - p[v].second, p[u].first - p[w].first, p[u].second - p[w].second);
		};
		
		int res = 0;
		for (int i = 1; i <= n; ++i) {
			if (online(u, v, i)) res++;
		}
		
		tmp = max(tmp, res);
	}
//	cout << tmp << '\n';
	if (tmp >= 2 * (n - tmp)) {
		cout << tmp - 2 * (n - tmp) << '\n'; 
	} else {
		cout << n % 3 << '\n';
	}	
}

signed main() {
//	freopen("1.in", "r", stdin); 
	ios::sync_with_stdio(false);
    while (cin >> n) {
    	if(n<3){
    		cout << n << '\n';
		} else 
    	solve();
	} 
	return 0;
}