#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
#include <cassert>
#include <complex>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
const int inf = 1e8;



int main() {
    int n;
    cin>>n;
    vector<P>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 tmp = 0;
            int s = p[i].first-p[j].first;
            int t = p[i].second-p[j].second;
            int x = p[i].first;
            int y = p[i].second;
            for(int k=0;k<n;k++){
                int x1 = p[k].first;
                int y1 = p[k].second;
                if(s*(y1-y)==t*(x1-x))tmp++;
            }
            ans = max(ans,tmp);
        }
    }
    cout<<ans<<endl;
}