#include "cave.h"
#include <bits/stdc++.h>
#define loop(i, a, b) for(long long i=a;i<b;i++)
#define pool(i, a, b) for(long long i=a-1;i>=b;i--)
#define fore(i, a) for(auto&& i:a)
#define fi first
#define se second
#define ps(a) push_back(a)
#define pb(a) pop_back(a)
#define sc scanf
#define vc vector
#define pa pair<ll, ll>
#define ll int
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define llmax LLONG_MAX/2
#define llmin -LLONG_MAX/2
using namespace std;
#define mn 5010
#define pa pair<ll, ll>
#define ld long double
ll ans[mn], cor[mn], n;
void exploreCave(int N){
n=N;
ll arr[n], get[n];
loop(i, 0, n){
loop(j, 0, n) arr[j]=0 ,get[j]=1;
loop(j, 0, i) arr[ans[j]]=cor[j], get[ans[j]]=0;
ll br=(tryCombination(arr)!=i);
vc<ll> act;
loop(j, 0, n) if(get[j]) act.ps(j);
ll l=0, r=(ll)act.size()-1;
while(l<r){
ll mid=(l+r)/2;
fore(v, act) arr[v]=!br;
loop(v, l, mid+1) arr[act[v]]=br;
if((tryCombination(arr)==i)) r=mid;
else l=mid+1;
}
ans[i]=act[l]; cor[i]=!br;
}
ll fa[n], fc[n];
loop(i, 0, n) fa[ans[i]]=i;
loop(i, 0, n) fc[ans[i]]=cor[i];
answer(fc, fa);
}
