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

using namespace std;

int main(void)
{
    int n;
    cin >> n;

    vector<string> a(n);

    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    sort(a.begin(), a.end());

    int count = 1;
    int max_count = count;
    for (int i = 1; i < n; i++) {
        if (a[i] == a[i - 1]) {
            count++;
            if (max_count < count) {
                max_count = count;
            }
        } else {
            count = 1;
        }
    }

    cout << max_count << endl;
    
    return 0;
}