#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-12;
#define endl "\n"
#define sp <<" "<<
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
template <typename Key, typename Value>
using hash_map = unordered_map<Key, Value, custom_hash>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(a, b)(rng);
// shuffle(all(a), rng);
int sequence(int N, vector<int> A) {
hash_map<int, int> pos;
hash_map<int, vector<int>> pref, cnt;
REP(i, 0, N) pos[--A[i]]++;
for (auto &x : pos) {
pref[x.first].resize(N);
cnt[x.first].resize(N);
REP(i, 0, N) {
if (A[i] < x.first) {
pref[x.first][i] = 1;
} else if (A[i] > x.first) {
pref[x.first][i] = -1;
} else {
pref[x.first][i] = 0;
cnt[x.first][i] = 1;
}
}
REP(i, 1, N) {
pref[x.first][i] += pref[x.first][i-1];
cnt[x.first][i] += cnt[x.first][i-1];
}
}
int ans = 0;
int sz, ele, have, block;
REP(i, 0, N) {
REP(j, i, N) {
if (A[i] == A[j]) {
// sz = j - i + 1;
ele = A[i];
have = cnt[ele][j] - (i > 0 ? cnt[ele][i-1] : 0);
block = pref[ele][j] - (i > 0 ? pref[ele][i-1] : 0);
block = abs(block);
if (have >= (have + block + 1) / 2) {
ans = max(ans, have);
}
} else {
// sz = j - i + 1;
ele = A[i];
have = cnt[ele][j] - (i > 0 ? cnt[ele][i-1] : 0);
block = pref[ele][j] - (i > 0 ? pref[ele][i-1] : 0);
block = abs(block);
if (have >= (have + block + 1) / 2) {
ans = max(ans, have);
}
ele = A[j];
have = cnt[ele][j] - (i > 0 ? cnt[ele][i-1] : 0);
block = pref[ele][j] - (i > 0 ? pref[ele][i-1] : 0);
block = abs(block);
if (have >= (have + block + 1) / 2) {
ans = max(ans, have);
}
}
}
}
return ans;
}
