#include <cstdio>
#include <vector>
#include <math.h>
#include <cstdlib>
#include <algorithm>
using namespace std;
double line_k(double x1, double y1, double x2, double y2)
{
double k = (y2 - y1)/(x2 - x1);
return k;
}
double line_b(double x1, double y1, double x2, double y2)
{
double b = y2 - (y2 - y1) * x2 / (x2 - x1);
return b;
}
bool is_on_line(double k, double b, double x, double y)
{
if (y <= x * k + b + 0.01 && y >= x * k + b - 0.01) return true;
return false;
}
struct point{
double x,y;
};
int main()
{
int n, counter = 2, max_zerosx = 0, max_zerosy = 0;
double x, y, k, b;
vector <point> koord;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%lf %lf", &x, &y);
if (x == 0) max_zerosx++;
if (y == 0) max_zerosy++;
{
koord.push_back(point());
koord[i].x = x;
koord[i].y = y;
}
}
int maximal = max(max_zerosx, max_zerosy);
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
k = line_k(koord[i].x, koord[i].y, koord[j].x, koord[j].y);
b = line_b(koord[i].x, koord[i].y, koord[j].x, koord[j].y);
for (int l = j + 1; l < n; l++)
if (is_on_line(k, b, koord[l].x, koord[l].y))
counter++;
if (counter > maximal) maximal = counter;
counter = 2;
}
}
printf("%d", maximal);
return 0;
}
