#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
#ifdef ONPC
#include"debug.h"
#else
#define debug(...) 42
#endif
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
const int mod = 1e9 + 7;
const int MAXN = 1e6 + 15;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
void exploreCave(int n) {
int s[n] = {};
for (int i = 0; i < n; i++){
int f = tryCombination(s);
if (f == i){
s[i] = 1;
}
}
int p[n] = {};
for (int i = 0; i < n; i++) p[i] = i;
answer(s, p);
return ;
}
