#include <bits/stdc++.h>

using ll = long long;

using namespace std;

int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    scanf("%d", &n);

    vector<int> x(n), y(n);
    for (int i = 0; i < n; ++i)
        scanf("%d%d", &x[i], &y[i]);

    int res{ 0 };
    for (int i =0; i < n-1; ++i)
    {
        for (int j = i+1; j < n; ++j)
        {
            int dx{ x[j] - x[i] }, dy{ y[j] - y[i] }, resw{ 2 };
            for (int k = j + 1; k < n; ++k)
            {
                if ((x[k] - x[j]) * dy == (y[k] - y[j]) * dx)
                    ++resw;
            }
            res = max(res, resw);
        }
    }

    printf("%d\n", res);

    return 0;
}