#include <iostream>
#include <vector>

using namespace std;

int main() {
    vector<int> arr;
    int num;

    // Read input until end-of-file (EOF)
    while (cin >> num) {
        arr.push_back(num);
    }

    if (arr.empty()) {
        cout << "0" << endl;
        return 0;
    }

    int max_length = 1, current_length = 1;

    // Traverse the array to find the longest contiguous sequence
    for (size_t i = 1; i < arr.size(); i++) {
        if (arr[i] == arr[i - 1]) {
            current_length++;
        } else {
            max_length = max(max_length, current_length);
            current_length = 1;
        }
    }

    // Final check after the loop
    max_length = max(max_length, current_length);

    cout << max_length << endl;
    return 0;
}