#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;r < n;r++){
int cnt = 0,l1=0;
vector <int> b(a.begin()+l,a.begin()+r+1);
sort(b.begin(),b.end());
int len = b.size();
int m1 = b[len/2];
int m2 = b[(len-1)/2];
for (int i = 0;i < len;i++){
if (b[i] == m1)
cnt++;
if (b[i] == m2)
l1++;
}
p = max({p,cnt,l1});
}
}
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;
//}
