#include "insects.h"
#include <variant>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll int
#define F first
#define S second
#define pb push_back
#define sz(x) (ll)x.size()
#define endl "\n"
typedef vector <ll> vi;
typedef pair <ll, ll> ii;
typedef vector <ii> vii;
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;
void printVct(vi &v){
for (ll i =0; i<sz(v); i++){
cout<<v[i]<<" ";
}
cout<<endl;
}
int min_cardinality(int N){
ll n = N;
vi v(n);
for (ll i =0; i<n; i++){
v[i] = i;
}
for (ll i =0; i<n; i++){
move_inside(i);
for (ll j =i+1; j<n; j++){
move_inside(j);
ll x = press_button();
if (x == 2){
v[j] = v[i];
}
move_outside(j);
}
move_outside(i);
}
// printVct(v);
sort(v.begin(), v.end());
vi f(n,0);
for (ll i =0; i<n; i++){
f[v[i]]++;
}
ll ans = 10000000;
for (ll i =0; i<n; i++){
if (f[i]){
ans = min(ans, f[i]);
}
}
return ans;
}
/*
6
5 8 9 5 9 9
*/
