#include<bits/stdc++.h>
#include "insects.h"
using namespace std;
template<class T>void minimize(T& a, T b){
if(a > b){
a = b;
}
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int min_cardinality(int n){
vector<int>parent(n), size(n);
iota(parent.begin(), parent.end(), 0);
fill(size.begin(), size.end(), 1);
auto find_set = [&] (int N){
while(N != parent[N]){
N = parent[N] = parent[parent[N]];
}
return N;
};
auto merge = [&] (int u, int v){
if((u = find_set(u)) != (v = find_set(v))){
if(size[u] < size[v]){
swap(u, v);
}
size[parent[v] = u] += size[v];
}
};
vector<int>d, s, low, high, p, perm(n);
iota(perm.begin(), perm.end(), 0);
shuffle(perm.begin(), perm.end(), rng);
for(int& i : perm){
move_inside(i);
if(press_button() == 2){
move_outside(i);
s.emplace_back(i);
low.emplace_back(0);
high.emplace_back(int(d.size()) - 1);
}
else{
d.emplace_back(i);
}
}
p.resize(s.size());
bool full = true;
while(true){
bool flag = false;
vector<vector<int>>query(d.size());
for(int i = 0; i < s.size(); i++){
if(low[i] <= high[i]){
int mid = (low[i] + high[i]) >> 1;
query[mid].emplace_back(i);
flag = true;
}
}
if(!flag){
break;
}
if(full){
for(int i = int(d.size()) - 1; i > -1; move_outside(d[i--])){
for(int& j : query[i]){
move_inside(s[j]);
if(press_button() == 2){
p[j] = d[i];
high[j] = i - 1;
}
else{
low[j] = i + 1;
}
move_outside(s[j]);
}
}
}
else{
for(int i = 0; i < d.size(); i++){
move_inside(d[i]);
for(int& j : query[i]){
move_inside(s[j]);
if(press_button() == 2){
p[j] = d[i];
high[j] = i - 1;
}
else{
low[j] = i + 1;
}
move_outside(s[j]);
}
}
}
full = !full;
}
for(int i = 0; i < s.size(); i++){
merge(s[i], p[i]);
}
int ans = n;
for(int i = 0; i < n; i++){
minimize(ans, size[find_set(i)]);
}
return ans;
}
