#include <iostream>
#include <vector>
#include <algorithm>

int main(){
    
    int N;
    std::cin >> N;
    
    std::vector<std::pair<int,int>> xy(N);
    for(int i=0;i<N;i++) std::cin >>xy[i].first>>xy[i].second;
    
    int ans =2;
    for(int i=0;i<N;i++){
        for(int j=i+1;j<N;j++){
            std::pair<int,int> grad ={xy[i].first-xy[j].first,xy[i].second-xy[j].second};
            int cnt=2;
            for(int k=0;k<N;k++){
                if(k==i or k==j) continue;
                
                if(grad.first*xy[k].second==grad.second&xy[k].first)cnt++;
                
            }
            ans =std::max(ans,cnt);
        }
    }
    std::cout <<ans<<std::endl;
}