#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
#include <iomanip>
#include<set>
#include <numeric>
using namespace std;


int main()
{
    int n, cnt = 2, max1 = -1;
    cin >> n;
    vector<vector<int>> v(n, vector<int>(2));
    for (int i = 0; i < n; i++) cin >> v[i][0] >> v[i][1];
    for (int i = 0; i < n-2; i++){
        for (int j = i+1; j < n-1; j++){
            int xp = v[j][0] - v[i][0], yp = v[j][1] - v[i][1];
            for (int k = j+1; k < n; k++){
                if (xp*(v[k][1] - v[i][1]) == yp*(v[k][0]-v[i][0])) cnt++;
            }
            max1 = max(max1, cnt);
            cnt = 2;
        }
    }
    if (n == 2) max1 = 2;
    cout << max1 << endl;
}