#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;

signed main(){
	cout<<fixed<<setprecision(10);
	
	const int MAX = 110;
	int N;
	int ans = 0;
	map<pair<int,int>, int> mp;
	vector<pair<int,int>> in;
	cin>>N;
	
	in.resize(N);
	
	for(int i = 0; i < N; i++){
		cin>>in[i].first>>in[i].second;
	}
	
	for(int i = 0; i < N; i++){
		for(int j = 0; j < N; j++){
			if(i == j) continue;
			
			int a = 0, b = 0;
			int c = 0, d = 0;
			int sum = 0;
			
			mp.clear();
			
			if(in[i].first == in[j].first){
				c = 1;
				d = in[i].first;
			} else {
				a = (in[j].first - in[i].first);
				b = (in[j].second - in[i].second);
			}
			
			for(int k = 0; k < N; k++){
				if(c){
					if(d == in[k].first) sum++;
				} else {
					int A = (in[k].first - in[i].first);
					int B = (in[k].second - in[i].second);
					
					if(A * b == a * B) sum++;
				}
			}
			ans = max(sum, ans);
	
		}
	}
	
	cout<<ans<<endl;
	
	return 0;
}