#include <bits/stdc++.h> #include "grader.h" //#include "grader.cpp" using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); #define rnd(l, r) uniform_int_distribution<int> (l,r)(rng) void solve(int n){ vector<int> id(n); iota(id.begin(), id.end(), 1); map<int,int> mp2; for(int i = 0; i < 59; i ++ ) { int c = id[rnd(0, id.size()-1)]; int cur = kth(c); mp2[cur] ++ ; vector<int> ni; for(int &i : id) if(i != c) ni.push_back(i); swap(ni, id); }; int ans = 0, mx = 0; for(auto [a, b] : mp2) if(mx < b) {mx = b; ans = a;}; say_answer(ans); return; }