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

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 all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

#define N 200007

ll x[N], y[N];

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

int main() {
         int n;
	while (scanf("%d", &n) != EOF) {
		rep(i, 1, n) x[i] = rd(), y[i] = rd();
		if (n <= 2) {printf("%d\n", n); continue;}
		auto calc = [&](int i, int j) {
			ll dx = x[i] - x[j];
			ll dy = y[i] - y[j];
			ll z = dy * x[i] - dx * y[i];
			int cnt = 0;
			rep(p, 1, n) if (dy * x[p] - dx * y[p] == z) ++cnt;
			return cnt - (n - cnt) * 2; 
		};
		int ans = 0;
		if (n <= 100) rep(i, 1, n) rep(j, i + 1, n) ans = max(ans, calc(i, j));
		else rep(i, 1, 100) {
			int u = rand() % n + 1, v = rand() % n + 1;
			while(u == v) v = rand() % n + 1;
			ans = max(ans, calc(u, v));
		}	
		printf("%d\n", ans); 
	}
	return 0;	
}