#include <iostream>
#include <utility>
#include <vector>
using namespace std;

using pint = pair<int, int>;

bool kyosen(pint a, pint b, pint c)
{
    int x1 = b.first - a.first, x2 = c.first - a.first;
    int y1 = b.second - a.second, y2 = c.second - a.second;
    return x1 * y2 - x2 * y1 == 0;
}

int main()
{
    int N;
    cin >> N;
    vector<pint> P(N);
    for (auto &p : P) cin >> p.first >> p.second;
    int ret = 0;
    for (int i = 0; i < N; i++) for (int j = 0; j < i; j++)
    {
        int tmp = 0;
        for (int k = 0; k < N; k++) tmp += kyosen(P[i], P[j], P[k]);
        ret = max(ret, tmp);
    }
    cout << ret << '\n';
}