#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <fstream>
#define pb push_back
#define pii pair <int, int>
#define me leet
using namespace std;
ifstream cin ("scmax.in");
ofstream cout ("scmax.out");
int a[30000];
int main(){
    int n, i, fi, se, max,idx,ide;
    fi = se = 1, max = 1;
    fi = 0;
    cin >> n >> a[0];
    for (i = 1 ; i < n; ++i){
        cin >> a[i];
        if (a[i] == a[i-1]) {
                se++;
        if (se-fi+1>max)max=se-fi+1;}
        else fi = 0 , se = 1;
    }
    cout<<max;
    return 0;
}