#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
#include <fstream>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
using namespace std;


#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll unsigned long long
#define INF (ll)1 << 60
#define MINF (2 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<long double,long double>

long double eps = 1e-9;

long double eudist(P a, P b) {
	long double res = abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second);
	return sqrt(res);
}
long double eudist(long double x1,long double y1,long double x2,long double y2) {
	long double res = abs(x1 - x2) * abs(x1 - x2) + abs(y1 - y2) * abs(y1 - y2);
	return sqrt(res);
}
bool check(P a, P b, P c) {
	vector<P> s;
	s.push_back(a);
	s.push_back(b);
	s.push_back(c);
	sort(ALL(s));
	long double ab = eudist(s[0], s[1]);
	long double bc = eudist(s[1], s[2]);
	long double ac = eudist(s[0], s[2]);
	return abs(ab + bc - ac) < eps;
}
ll ans;
int main() {
	ll n;
	cin >> n;
	vector<P> s(n);
	REP(i, n)cin >> s[i].first >> s[i].second;
	REP(i, n) {
		FOR(j, i + 1, n) {
			ll now = 2;
			REP(k, n) {
				if (i == k or j == k)continue;
				if (check(s[i], s[j], s[k]))now++;
			}
			ans = max(ans, now);
		}
	}
	cout << ans << endl;
}