/*
ZADATAK: kartice
JEZIK: C++
*/

#include <iostream>
#include <map>
#include <string>
#include <cstdio>
using namespace std;

const long MaxN=3001;

map<pair<long, long> , long> hash;
long x[MaxN],y[MaxN];
long n;

void init_solve(){
  FILE *f,*fout;
  f=fopen("kartice.in","r"); fout=fopen("kartice.out","w");
  fscanf(f,"%ld",&n);
  long maxa=0;
  for (long i=0; i<n; i++){    
    fscanf(f,"%ld %ld%",&x[i],&y[i]);    
    
    for (long j=0; j<i; j++){
      long tx=x[j]-x[i], ty=y[j]-y[i];
      pair<long, long> key(tx,ty);
      hash[key]++; if (hash[key]>maxa) maxa=hash[key];
      
      tx=x[i]-x[j], ty=y[i]-y[j];
      key=pair<long, long>(tx,ty);
      hash[key]++; if (hash[key]>maxa) maxa=hash[key];
    }
    
    fprintf(fout,"%ld\n",maxa);
  }
  fclose(fout); fclose(f);
}      

int main(){
  init_solve();
  return 0;  
}

