#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>

using namespace std;

typedef  long long int lint;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define llower(v,hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v,hoge) *upper_bound(v.begin(), v.end(), hoge)
#define mp make_pair
#define IP pair<int,int>
#define enld endl

int main() {
	lint N;
	cin >> N;
	vector<double>X(N);
	vector<double>Y(N);
	rep(i, N) {
		cin >> X[i] >> Y[i];
	}
	lint ans = 0;
	lint cnt = 0;
	rep(i, N) {
		rep(j, N) {
			if (X[i] - X[j] != 0) {
				double a = (Y[i] - Y[j]) / (X[i] - X[j]);
				double b = Y[i] - a * X[i];
				rep(ii, N) {
					if (Y[ii] == a * X[ii] + b) {
						cnt++;
					}
				}
				ans = max(ans, cnt);
				cnt = 0;
			}
		}
	}
	rep(t, 101) {
		rep(i, N) {
			if (X[i] == t) {
				cnt++;
			}
		}
		ans = max(ans, cnt);
		cnt = 0;
	}
	cout << ans << endl;
}