#include <algorithm>
#include <iostream>
#include <iterator>
int main()
{
using U = unsigned long; // <10**9
std::istream_iterator<U> numbers {std::cin}, eof;
if (numbers == eof)
return 1; // invalid input, no size
U count = 0, max_same_count = count; // <10**5
U last = -1;
for (++numbers /* skip size */; numbers != eof; ++numbers) {
if (!count)
last = *numbers;
if (last == *numbers)
++count;
else {
max_same_count = std::max(max_same_count, count);
count = 1;
last = *numbers;
}
}
std::cout << std::max(max_same_count, count) << '\n';
}
I2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8aXRlcmF0b3I+CgppbnQgbWFpbigpCnsKICB1c2luZyBVID0gdW5zaWduZWQgbG9uZzsgLy8gPDEwKio5CiAgc3RkOjppc3RyZWFtX2l0ZXJhdG9yPFU+IG51bWJlcnMge3N0ZDo6Y2lufSwgZW9mOwogIGlmIChudW1iZXJzID09IGVvZikKICAgIHJldHVybiAxOyAvLyBpbnZhbGlkIGlucHV0LCBubyBzaXplCgogIFUgY291bnQgPSAwLCBtYXhfc2FtZV9jb3VudCA9IGNvdW50OyAvLyA8MTAqKjUKICBVIGxhc3QgPSAtMTsKICBmb3IgKCsrbnVtYmVycyAvKiBza2lwIHNpemUgKi87IG51bWJlcnMgIT0gZW9mOyArK251bWJlcnMpIHsKICAgIGlmICghY291bnQpCiAgICAgIGxhc3QgPSAqbnVtYmVyczsKICAgIGlmIChsYXN0ID09ICpudW1iZXJzKQogICAgICArK2NvdW50OwogICAgZWxzZSB7CiAgICAgIG1heF9zYW1lX2NvdW50ID0gc3RkOjptYXgobWF4X3NhbWVfY291bnQsIGNvdW50KTsKICAgICAgY291bnQgPSAxOwogICAgICBsYXN0ID0gKm51bWJlcnM7CiAgICB9CiAgfQogIHN0ZDo6Y291dCA8PCBzdGQ6Om1heChtYXhfc2FtZV9jb3VudCwgY291bnQpIDw8ICdcbic7Cn0K