#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
 
int func(vector<double>arr) {
    sort(arr.begin(), arr.end());
    int k = 1, max=1;
    for (int i = 1; i < arr.size() ;i++)
    {
        if (arr[i]==arr[i-1])
        {
            k++;
        }
        else {
            k = 1;
        }
        if (k>max)
        {
            max = k;
        }
         
    }  
    return max;
}
 
 
int main() {
    int n,a1=0,a2=0,a3=0,a4=0;
    cin >> n;
 
    vector<double>arr1;
    vector<double>arr2;
    vector< double>arr3;
    vector< double>arr4;
 
    vector<double>res;
    for (int i = 0; i < n; i++)
    {
        double x, y;
        double k;
        cin >> x >> y;
        if (x > 0 && y > 0)
        {
            k = y / x ;
            arr1.push_back(k);
        }
        if (x < 0 && y > 0) {
            k = y / x ;
            arr2.push_back(k);
        }
        if (x < 0 && y < 0) {
 
            k = y / x ;
            arr3.push_back(k);
        }
        if (x > 0 && y < 0) {
            k = y / x ;
            arr4.push_back(k);
        }
 
        if (y == 0 && x > 0)
        {
            a1++;
        }
        if (y > 0 && x == 0)
        {
            a2++;
        }
        if (y == 0 && x < 0)
        {
            a3++;
        }
        if (y < 0 && x == 0)
        {
            a4++;
        }
    }
     
 
    res.push_back(func(arr1));
    res.push_back(func(arr2));
    res.push_back(func(arr3));
    res.push_back(func(arr4));
     
    res.push_back(a1);
    res.push_back(a2);
    res.push_back(a3);
    res.push_back(a4);
    int t = *max_element(res.begin(), res.end());
    if (t <= 0)
        cout << 0;
    else
        cout << t;
     
}