#include<bits/stdc++.h>
#include "insects.h"
using namespace std;
template<class T>void minimize(T& a, T b){
if(a > b){
a = b;
}
}
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>S;
for(int i = 0; i < n; i++){
move_inside(i);
S.emplace_back(i);
if(press_button() == 2){
for(int j = int(S.size()) - 2; j > -1; j--){
move_outside(S[j]);
if(press_button() == 1){
break;
}
}
}
}
int ans = n;
for(int i = 0; i < n; i++){
minimize(ans, size[find_set(i)]);
}
return ans;
}
