#include <cmath>
#include <cstdio>
#include <fstream>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

using namespace std;

struct node{
    double x,y;
}star[110];

double abx(double x){
    if(x<0) return -x;
    else return x;
}

int main(){
    freopen("asm_fuel.in","r",stdin);
    freopen("asm_fuel.out","w",stdout);
    int n,ans=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf("%lf%lf",&star[i].x,&star[i].y);
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            double k,b;int cnt=0;
            k=(star[i].y-star[j].y)/(star[i].x-star[j].x);
            b=star[i].y-k*star[i].x;
            for(int l=0;l<n;l++){
                if(l==i||l==j)  cnt++;
                else if(abx(star[l].x*k+b-star[l].y)<10e-6) cnt++;
            }
            ans=max(cnt,ans);
        }
    }
    printf("%d\n",ans);
    return 0;
}