#include "sequence.h"
#include <cassert>
#include <cstdio>
#include "bits/stdc++.h"
using namespace std;
int sequence(int n,vector <int> a){
int p = 0;
for (int l = 0;l < n-1;l++){
for (int r = l+1;r < n;r++){
int cnt = 0;
vector <int> b(a.begin()+l,a.begin()+r);
sort(b.begin(),b.end());
if (b.size()&1){
int m = b[b.size()/2];
for (int i = 0;i < b.size();i++){
if (b[i] == m)
cnt++;
}
}
else {
int m1 = b[b.size()/2-1];
int m2 = b[b.size()/2];
int l1 = 0,l2 = 0;
for (int i = 0;i < b.size();i++){
if (m1 == b[i])
l1++;
if (m2 == b[i])
l2++;
}
if (m1^m2)
cnt = max(l1,l2);
else cnt = l1+l2;
}
p = max(p,cnt);
}
}
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;
// }
