#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;
    
    while (Q--) {
        int n;
        cin >> n;
        vector<pair<int, int>>p(n);
        for (int i = 0; i < n; i++)cin >> p[i].first>>p[i].second;
        int ans = 0;
        for (int i = 0; i < n; i++) {
            for (int j = i+1; j < n; j++) {
                
                int t = 0;
                int dx = p[i].first - p[j].first;
                int dy = p[i].second - p[j].second;
                for(int k = 0; k < n; k++) {
                    int dx2 = p[i].first - p[k].first;
                    int dy2 = p[i].second - p[k].second;

                    if (dx * dy2 == dy * dx2)t++;
                }
                ans = max(t, ans);
            }
        }
        cout << ans;
    }
    
    return 0;
}