#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define eb emplace_back
#define pb push_back
#define ar array
#define nl '\n'
#include "cave.h"
// #include "grader.c"
void exploreCave(int n) {
int S[n]{}, D[n];
for(int i = 0; i < n; i++) {
int cur = tryCombination(S);
if(cur == -1) break;
for(int j = 0; j < n; j++) {
if(S[j]) continue;
S[j] = 1;
if(tryCombination(S) > cur) break;
S[j] = 0;
}
}
for(int i = 0; i < n; i++) {
S[i] = !S[i];
D[i] = tryCombination(S);
S[i] = !S[i];
}
answer(S, D);
}
