#include "insects.h"
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using ll = long long;
template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }
mt19937 mt(random_device{}());
int min_cardinality(int N) {
int nk = 0;
vector<bool> f1(N, false), f2(N, false);
{
vector<bool> used(N);
rep (i, N) {
move_inside(i);
if (press_button() == 2) move_outside(i);
else ++nk, used[i] = true;
}
f1 = used;
}
int ok = 1, ng = N / nk + 1;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
vector<bool> used(N), used2(N);
int cnt = 0, lt = -1;
rep (i, N) {
if (f1[i]) {
++cnt;
continue;
}
if (f2[i]) continue;
move_inside(i);
int t = press_button();
if (t > mid) move_outside(i), used2[i] = true;
else {
cnt++, used[i] = true;
}
lt = t;
}
if (cnt == nk * mid) {
ok = mid;
rep (i, N) {
if (used[i]) f1[i] = true;
}
}
else {
rep (i, N) {
if (used2[i]) f2[i] = true;
if (used[i]) move_outside(i);
}
ng = mid;
}
}
return ok;
}
