#include "conveyor.h"
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;

const int N=100007;

vector<pair<int,int>>G[N];
bool dead[N],odw[N];
int deg[N];
bool is[N];
vector<int>ans;
vector<int>X,Y;

vector<int>V0,V1;

void dfs(int v,int o,int c)
{
	//cout<<"XDDD "<<v<<endl;
	odw[v]=1;
	if(c==0) V0.pb(v);
	else V1.pb(v);
	for(auto [u,k]:G[v])
	{
		if(dead[u])
		{
			if(k>0) X[k-1]=1;
			else X[-k-1]=0;
		}
		if(odw[u]||dead[u]) continue;
		deg[v]++;
		deg[u]++;
		X[abs(k)-1]=rand()%2;
		dfs(u,v,c^1);
	}
}

void Solve(int n,vector<int>A,vector<int>B)
{
	X.resize(n-1,0);
	Y.resize(n,0);
	ans.resize(n-1);
	for(int i=1;i<=n-1;i++)
	{
		G[A[i-1]].pb({B[i-1],i});
		G[B[i-1]].pb({A[i-1],-i});
	}
	while(true)
	{
		memset(odw,0,sizeof odw);
		for(int i=0;i<n;i++) Y[i]=0;
		for(int i=0;i<n-1;i++) X[i]=0;
		for(int i=0;i<n;i++) deg[i]=0;
		for(int i=0;i<n;i++)
		{
			if(dead[i]||odw[i]) continue;
			V0.clear(),V1.clear();
			dfs(i,0,0);
			if(rand()%2) swap(V1,V0);
			for(auto x:V0) Y[x]=1;
		}
	/*	cout<<"Q"<<" "<<xd<<endl;
		for(auto x:X) cout<<x<<" ";
		cout<<endl;
		for(auto x:Y) cout<<x<<" ";
		cout<<endl;*/
		vector<int>Z=Query(X,Y);
		//for(auto x:Z) cout<<x<<" ";
	//	cout<<endl;
		//cout<<"XDD"<<endl;
		for(int i=0;i<n;i++)
		{
			if(Y[i]&&Z[i])
			{
				//cout<<"KILL "<<i<<endl;
				for(auto [u,k]:G[i])
				{
					if(!dead[u]) 
					{
						if(k>0) ans[k-1]=X[k-1]^1;
						else ans[-k-1]=X[-k-1];
						is[abs(k)-1]=1;
					}
				}
				dead[i]=1;
			}
			if(deg[i]==1&&Y[i]&&!Z[i])
			{
				for(auto [u,k]:G[i])
				{
					if(!dead[u]) 
					{
						if(k>0) ans[k-1]=X[k-1];
						else ans[-k-1]=X[-k-1]^1;
						is[abs(k)-1]=1;
					}
				}
				dead[i]=1;
			}
		}
		bool xd=1;
		for(int i=0;i<n-1;i++) xd&=is[i];
		if(xd) break;
	}
	/*for(auto x:ans) cout<<x<<" ";
	cout<<endl;*/
	Answer(ans);
}