#include <bits/stdc++.h>
#include "cave.h"
// Subtaks1 : Solved
// Subtaks2 : Unsolved
// Subtaks3 : solved
// Subtaks4 : Unsolved
// Subtaks5 : Unsolved
using namespace std;
#define all(x) (x).begin(), (x).end()
#define isz(x) int(x.size())
using vi = vector<int>;
using ll = long long;
using pii = pair<int, int>;
const int inf = 1e9;
void exploreCave(int N) {
int n = N;
int s[n], d[n];
fill(s, s + n, 0);
for (int i = 0; i < n; i++) {
s[i] = 1;
int idx = tryCombination(s);
d[i] = idx;
s[i] = 0;
}
assert(count(d, d + n, inf) == 0);
answer(s, d);
}
