#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
int tp;
struct Point{
        double x, y;
        Point(){
            
        }
        Point(double x, double y){
            this->x = x;
            this->y = y;
        }
};
Point point[1010];
struct Node{
    double k, b;
    Node(double k,double b){
        this->k = k;
        this->b = b;
    }
    Node(){
        
    }
    bool operator < (const Node &a) const{
        if(k != a.k){//直接比就可以。。。 
            return k < a.k;
        }
        else//
            return b < a.b;
    }
};
Node dt[250000];
Node operator + (Point a,Point b){
        double k, t;
        k = (a.y - b.y) / (a.x - b.x);
        t = a.y - k * a.x;
        return Node(k,t);
}
bool operator == (Node a, Node b){
        if(abs(a.k - b.k) < 1e-6){
            if(abs(a.b - b.b) < 1e-6){
                return true;
            }
        }
        return false;
}
int getn(int a, int b, int c){
    double t = b * b - 4 * a * c;
    double x = ( -b + sqrt(t) ) / (2.0 * a);
    return (int)x;
}
int main(){
    int N;
    while(~scanf("%d",&N)){
        double x, y;
        tp = 0; 
        for(int i = 0; i < N; i++){
            scanf("%lf%lf",&x,&y);
            point[i] = Point(x, y);
            for(int j = 0; j < i; j++){
                dt[tp++] = point[i] + point[j];
            }
        }
        if(N ==  1){
            puts("1");continue;
        }
        sort(dt, dt + tp);
        int ans = 0, temp = 0;
        for(int i = 1; i < tp; i++){
            if(dt[i] == dt[i - 1]){
                temp++;
                ans = max(ans,temp);
            }
            else temp = 0;
        }
        ans++;
        printf("%d\n", getn(1, -1, -2 * ans) );
    }
    return 0;
}