#include "sequence.h"
#include "bits/stdc++.h"
//#include <cassert>
using namespace std;
int sequence(int n,vector <int> a){
vector <vector <int>> in(n+1);
for (int i = 0;i < n;i++){
in[a[i]].push_back(i);
}
int p = 1;
for (int i = 1;i <= n;i++){
if (in[i].empty())
continue;
int c = in[i].size();
int l = in[i][0];
int r = in[i][in[i].size()-1];
int ct = (r-l+1)-c;
int cnt = l+(n-1-r);
if (ct <= cnt+c)
p = max(p,c);
else {
int k = 1;
int mx = 1;
for (int j = 1;j < c;j++){
if (in[i][j] == in[i][j-1]+1)
k++;
else {
mx = max(mx,k);
k=1;
}
}
mx = max(mx,k);
p = max(mx,p);
}
}
return p;
}
//
//int main() {
// freopen("file.in","r",stdin);
// int N;
// assert(1 == scanf("%d", &N));
//
// std::vector<int> A(N);
// for (int i = 0; i < N; ++i) {
// assert(1 == scanf("%d", &A[i]));
// }
//
// int result = sequence(N, A);
// printf("%d\n", result);
// return 0;
//}
