#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
//constexpr long long mod = 1000000007LL;
constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

vector<ll> x, y;

pair<ll, ll> kata(ll i, ll j) {
	if (x[i] == x[j]) {
		return { INF,INF };
	}
	else {
		ll dx = x[j] - x[i];
		ll dy = y[j] - y[i];
		if (dx < 0) dx *= -1, dy *= -1;
		ll g = gcd(llabs(dx), llabs(dy));
		dx /= g;
		dy /= g;
		return { dx,dy };
	}
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	int n; scanf("%d", &n);
	x.resize(n), y.resize(n);
	for (int i = 0; i < n; i++) {
		scanf("%lld %lld", &x[i], &y[i]);
	}
	ll res = 0;
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			auto k = kata(i, j);
			ll cnt = 1;
			for (int l = 0; l < n; l++) {
				if (i == l) continue;
				if (k == kata(i, l)) {
					//cout << i << " " << l << endl;
					cnt++;
				}
			}
			chmax(res, cnt);
		}
	}
	cout << res << endl;
	return 0;
}