#include <bits/stdc++.h>
#include "sequence.h"
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T, class U, class Compare = less<>> using order_statistic_map = tree<T, U, Compare, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class Compare = less<>> using order_statistic_set = order_statistic_map<T, null_type, Compare>;

int sequence(int n, vector<int> a) {
	for (auto &val : a) --val;
	int res = 0;
	for (int i = 0; i < n; ++i) {
		vector<int> cnt(n);
		order_statistic_set<pair<int, int>> sub;
		for (int j = i; j < n; ++j) {
			++cnt[a[j]];
			sub.insert({a[j], j});
			int len = j - i + 1;
			// auto val = sub.find_by_order(len / 2);
			res = max({res, cnt[(sub.find_by_order(len / 2))->first], cnt[(sub.find_by_order((len - 1) / 2))->first]});
		}
	}
	return res;
}