#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

struct P {
    int x, y;
};

int main() {
    int n;
    cin >> n;

    vector<P> p(n);
    for (int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        p[i] = { x, y };
    }

    int r = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            int t = 2;
            for (int k = 0; k < n; k++) {
                if (k == i || k == j) continue;
                int x0 = p[i].x - p[j].x;
                int x1 = p[i].x - p[k].x;
                int y0 = p[i].y - p[j].y;
                int y1 = p[i].y - p[k].y;
                if (x0 * y1 - x1 * y0 == 0) t++;
            }
            r = max(r, t);
        }
    }

    cout << r << endl;

    return 0;
}