#include <bits/stdc++.h>
using namespace std;
#include "cave.h"
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);
int a[5010],b[5010],c[5010];
void reval(int i,int x){
a[i] = b[i] ? a[i] : x;
}
void exploreCave(int n){
int val,l,r;
forinc(i,0,n-1){
l=0,r=n-1;
forinc(j,l,r) reval(j,0);
int ret=tryCombination(a); if(ret<0) ret=n+1;
if(ret>i) val=0; else val=1;
while(l<=r){
int m=(l+r)/2;
if(l==r){
a[l]=val;
b[l]=1;
c[l]=i;
break;
}
forinc(j,l,r) reval(j,j>m ? val : val^1);
int ret=tryCombination(a); if(ret<0) ret=n+1;
if(ret<=i) r=m; else l=m+1;
}
}
answer(a,c);
}
