#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
typedef long long ll;
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
int n;
const int maxN=5000 + 15;
int a[maxN],b[maxN];
int con[maxN];
int tryCombination(int s[]);
void answer(int S[],int D[]);
void exploreCave(int N){
//subtask 1
int d[n];
for(int i=0;i<n;i++) d[i]=i;
int s[n]={0};
for(int i=0;i<n;i++){
int combi[n];
for(int j=0;j<n;j++){
if(j<i) combi[j]=s[j];
else if(j==i) combi[j]=1;
else combi[j]=0;
}
int see=tryCombination(combi);
if(see==-1){
answer(combi,d);
return ;
}
if(see==i) s[i]=0;
else s[i]=1;
}
answer(s,d);
}
