#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define ST first
#define ND second
ostream& operator<<(ostream &out, string str) {
for(char c : str) out << c;
return out;
}
template<class L, class R> ostream& operator<<(ostream &out, pair<L, R> p) {
return out << "(" << p.ST << ", " << p.ND << ")";
}
template<class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
out << "{";
for(auto it = a.begin(); it != a.end(); it = next(it))
out << (it != a.begin() ? ", " : "") << *it;
return out << "}";
}
void dump() { cerr << "\n"; }
template<class T, class... Ts> void dump(T a, Ts... x) {
cerr << a << ", ";
dump(x...);
}
#ifdef DEBUG
# define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
# define debug(...) false
#endif
template<class T> int size(T && a) { return (int) a.size(); }
using LL = long long;
using PII = pair<int, int>;
#include "cave.h"
void exploreCave(int n) {
vector<int> states(n), door(n, -1);
auto query = [&]() {
int r = tryCombination(states.data());
return r != -1 ? r : n;
};
auto range_flip = [&](int l, int r) {
FOR(i, l, r)
if(door[i] == -1)
states[i] ^= 1;
};
REP(i, n) {
auto taken = [&]() {
return i < query();
};
bool t = taken();
int l = 0, r = n - 1;
while(l < r) {
int m = (l + r) / 2;
range_flip(l, m);
if(taken() != t)
r = m;
else
l = m + 1;
range_flip(l, m);
}
if(!t) range_flip(l, l);
door[l] = i;
}
answer(states.data(), door.data());
}
