#include "insects.h"
#include<bits/stdc++.h>

namespace Sol{

using namespace std;
using ll=long long;
using u64=unsigned long long;
//using lll=__int128_t;
using lf=long double;
using Pr=pair<int,int>;
#define F(i,l,r) for(ll i=l;i<=ll(r);++i)
#define G(i,r,l) for(ll i=r;i>=ll(l);--i)
#define ct const
#define il inline
#define pb push_back
#define fi first
#define se second
#define mkr make_pair
template<class T>
il void tomn(T&x,T ct&y){y<x?x=y,0:0;}
template<class T>
il void tomx(T&x,T ct&y){x<y?x=y,0:0;}
#define dbg(...) fprintf(stderr,__VA_ARGS__)
#define CUT dbg("===================\n")
ct lf EPS=1e-10L;
il int dcmp(lf x){return fabs(x)<=EPS?0:(x<0?-1:1);}
ct ll INF=4e18L;
//ct int INF=1.02e9;
//il void rd(int&x){scanf("%d",&x);}
//il void rd(ll&x){scanf("%lld",&x);}

void ins(int i){move_inside(i);}
void del(int i){move_outside(i);}
int qry(){return press_button();}

ct int N=2050;
int n,m;
bitset<N>vis,res;
int qry(int lim){
	res.reset();
	int ret=0;
	F(i,0,n-1)if(vis[i]){
		ins(i);
		if(qry()>lim)del(i);
		else res[i]=1,++ret;
	}
	F(i,0,n-1)if(res[i])del(i);
	return ret;
}
void wt(){
	F(i,0,n-1)dbg("%d",(int)vis[i]);
	dbg("\n");
}
int main(){
	F(i,0,n-1)vis[i]=1;
	m=qry(1),vis^=res;
	
//	wt();
	dbg("m=%d\n",m);
	
	int ans=1;
	while(n=vis.count(),n>=m){
		int lim=n/(2*m);
		if(n-m*lim>m*(lim+1)-1)++lim;
		
//		CUT;
//		dbg("lim=%d\n",lim);
//		wt();
		
		int tmp=qry(lim);
		if(tmp<m*lim)vis=res;
		else vis^=res,ans+=lim;
		
//		wt();
//		CUT;
		
//		F(i,0,1e8);
	}
	return ans;
}

}//namespace Sol

int min_cardinality(int N) {
	Sol::n=N;
  return Sol::main();
}