/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
#include<bits/stdc++.h>
#include"cave.h"
/*#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
template<class T>
using oset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
/**/
typedef int ll;
//typedef long long ll;
typedef unsigned long long ull;
typedef __int128 vll;
typedef unsigned __int128 uvll;
ll _i=0;
#define ffn(x) _i=x
#define llll std::pair<ll , ll>
#define stitr set<ll>::iterator
#define fora(y,x) for(ll y=_i;x>y;y++)
#define pb push_back
#define pf push_front
#define halo cout << "hello\n"
#define fi first
#define sec second
#define all(a) a.begin() , a.end()
const ll limit = 1e9+7;
const ll ous = 4e5 + 7;
const ll dx[4] = {1 , 0 , 0 , -1} , dy[4] = {0,1,-1,0};
void exploreCave(int n){
ll lev[n];
ll ar[n];
ll gd[n];
memset(lev , -1 , sizeof(lev));
for(ll i = 0;n>i;i++){
for(ll j = 0;n>j;j++){
if(lev[j] == -1){
ar[j] = 0;
}
else{
ar[j] = gd[j];
}
}
ll x = (tryCombination(ar) != i ?0 :1);
ll l = 0 , r = n - 1;
while(r > l){
ll md = (l + r) / 2;
for(ll j = l;md>=j;j++){
if(lev[j] == -1){
ar[j] = x ^ 1;
}
else{
ar[j] = gd[j];
}
}
for(ll j = md + 1;r>=j;j++){
if(lev[j] == -1){
ar[j] = x;
}
else{
ar[j] = gd[j];
}
}
(tryCombination(ar) == i ?r = md :l = md + 1);
}
gd[l] = x;
lev[l] = i;
}
answer(gd , lev);
return;
}
/*signed main(){
std::ios_base::sync_with_stdio(false);std::cin.tie(NULL);
ll t=1;
std::cin >> t;
ll o = 1;
while(t--){
//cout << "Case " << o++ << ":\n";
solve();
}
return 0;
}*/
