/* AUTHOR: TUAN ANH - BUI */
// ~~ icebear ~~
#ifndef meo
#include "incursion.h"
#endif // meo
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y) return x = y, true;
return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y) return x = y, true;
return false;
}
#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"
/*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN TST26 */
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 27092008;
const ll INF = (ll)1e18 + 27092008;
const int N = 2e5 + 5;
vector<int> G[N];
int n, sz[N], par[N], h[N], A, forbid;
void loadGraph(vector<pair<int, int>> F) {
n = (int)F.size() + 1;
FOR(i, 1, n) {
G[i].clear();
}
for(auto e : F) {
G[e.fi].pb(e.se);
G[e.se].pb(e.fi);
}
}
void dfs(int u) {
sz[u] = 1;
for(int v : G[u]) if (v != par[u]) {
h[v] = h[u] + 1;
par[v] = u;
dfs(v);
sz[u] += sz[v];
}
}
#ifdef meo
int visit(int v) {
printf("visit node: %d\n", v);
fflush(stdout);
int x; cin >> x;
return x;
}
#endif // me
vector<int> find_center() {
dfs(1);
int mx = max_element(h + 1, h + n + 1) - h;
par[mx] = h[mx] = 0;
dfs(mx);
int r = max_element(h + 1, h + n + 1) - h;
int best = h[r];
vector<int> center;
while(r != mx) {
r = par[r];
if (h[r] == best / 2) center.pb(r);
}
return center;
}
void find_treasure(int u, int par) {
vector<ii> childs;
for(int v : G[u]) if (v != par) {
childs.emplace_back(sz[v], v);
}
sort(all(childs), greater<ii>());
for(auto &x : childs) if (x.se != forbid) {
int T = visit(A = x.se);
if (T == 1) {
find_treasure(x.se, u);
break;
}
visit(A = u);
}
}
vector<int> mark(vector<pair<int, int>> E, int safe) {
loadGraph(E);
vector<int> center = find_center();
int nearest = 0, best = inf;
for(int x : center) {
par[x] = h[x] = 0;
dfs(x);
if (minimize(best, h[safe])) nearest = x;
}
printf("NEAREST NODE: %d\n", nearest);
par[nearest] = 0;
dfs(nearest);
vector<int> T(n,0);
while(safe > 0) {
T[safe-1] = 1;
safe = par[safe];
}
return T;
}
void locate(vector<pair<int, int>> E, int S, int T) {
loadGraph(E);
vector<int> center = find_center();
int best = inf, nearest = 0;
for(int x : center) {
dfs(x);
if (minimize(best, h[S])) nearest = x;
}
par[nearest] = 0;
dfs(nearest);
while(S != nearest) T = visit(S = par[S]);
if (T == 0) T = visit(S = (nearest ^ center[0] ^ center[1]));
cerr << "CENTER : " << S << endl;
dfs(S);
if (center.size() & 1) forbid = (S ^ center[0] ^ center[1]);
find_treasure(A = S, -1);
cerr << A << '\n';
}
