#include<bits/stdc++.h> #include "grader.h" using namespace std; void solve(int N){ mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int l = 1, r = N; int ans = -1; for (int q = 1; q <= 25; q++){ int x = uniform_int_distribution<int>(l,r)(rng); int val = kth(x); int C = cnt(val); if (C > N / 3) ans = val; } say_answer(ans); }