#include "avoid.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000;
vector<vector<int>> lvl (20);
vector<int> RESPONSES(20);
int last_lvl = 0;
void build (int l, int r, int i) {
if (l == r) {
last_lvl = max(last_lvl, i);
return;
}
int m = (l + r) >> 1;
for (int j = l; j <= m; j++) {
lvl[i].push_back(j);
}
build(l, m, i + 1);
build(m + 1, r, i + 1);
}
int find (int l, int r, int i) {
if (l == r) return l;
int m = (l + r) >> 1;
if (RESPONSES[i]) return find(l, m, i + 1);
else return find(m + 1, r, i + 1);
}
pair<int, int> scout(int r, int h) {
build(1, maxn, 0);
for (int i = 0; i < last_lvl; i++) {
send(lvl[i]);
}
vector<int> ans = wait();
RESPONSES = ans;
int resp = find(1, maxn, 0);
return {resp, resp};
}
