#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;
template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "["; REP(i, U) out << v[i] << ", "; out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
void exploreCave(int n) {
vector<int> s(n); // correct stav switchu
vector<int> d(n); // ku ktoremu switchu je door i; Potom sprav inverse permutaciu!!!
auto solve = [&](int ind){
vector<int> f(n, 1);
auto fix = [&](){
REP(i, ind){
f[d[i]] = s[d[i]];
}
};
auto go = [&](){
int *p = &f[0];
return tryCombination(p);
};
auto get_state = [&](){
int res = go();
int state = ((res > ind || res == -1) ? 1 : 0);
return state;
};
fix();
int state = get_state();
int l = 0;
int r = n;
while((r - l) > 1){
int mid = (l + r) >> 1;
REP(i, n){
if(i >= l && i < mid)
f[i] = 0;
else
f[i] = 1;
}
fix();
int nstate = get_state();
if(nstate == state){
l = mid;
}
else{
r = mid;
}
}
d[ind] = l;
if(state == 1)
s[l] = 1;
else
s[l] = 0;
};
REP(i, n)
solve(i);
vector<int> inverse_d(n);
REP(i, n){
inverse_d[d[i]] = i;
}
int* p0 = &s[0];
int* p1 = &inverse_d[0];
answer(p0, p1);
}
