#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<ll, ll, ll> tlll;

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '0');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)

#define N 200007

ll n, x[N], y[N];

ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}

map<tlll, int> f;

int main() {
	while (scanf("%lld", &n) != EOF) {
		f.clear();
		rep(i, 1, n) x[i] = rd(), y[i] = rd();
		auto calc = [&](int i, int j) {
			ll dx = x[i] - x[j];
			ll dy = y[i] - y[j];
			ll g = gcd(abs(dx), abs(dy));
			dx /= g; dy /= g;
			if (dx < 0) dx = -dx, dy = -dy;
			++f[mt(dy, -dx, dy * x[i] - dx * y[i])];
		};
		if (n <= 30) {
			rep(i, 1, n) rep(j, i + 1, n) calc(i, j);
		} else {
			int tim = n * 10;
			rep(tt, 1, tim) {
				int i = rand() % (n - 1) + 1;
				int j = i + rand() % (n - i) + 1;
				calc(i, j);
			}
		}
		tlll ret = f.begin() -> first;
		for (auto [w, cnt] : f) if (cnt > f[ret]) ret = w;
		auto [a, b, c] = ret;
		int cnt = 0;
		rep(i, 1, n) if (a * x[i] + b * y[i] == c) ++cnt;
		int rem = n - cnt;
		printf("%d\n", rem * 2 >= cnt ? 0 : cnt - rem * 2);
		fflush(stdout);
	}
	return 0;	
}