#include "conveyor.h"

#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e5+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,X[N],Y[N],vis[N];
vector<int> S[N],st[3];
int d[N];
void make(int x,int La){
	int flag=0;
	for(int i:S[x]) if(int y=X[i]^Y[i]^x;flag|=(vis[i]==-1),y^La){
		d[y]=(d[x]+1)%3;
		make(y,x);
	}
	if(flag) st[d[x]].push_back(x);
	if(La){
		rotate(S[x].begin(),find(all(S[x]),La),S[x].end());
		reverse(all(S[x]));
	}
}
void Solve(int nn, vector<int> A, vector<int> B) {
	n=nn;
	for(int i=0;i<n-1;i++) X[i]=A[i],Y[i]=B[i],vis[i]=-1;
	for(int i=0;i<n-1;i++){
		S[A[i]].push_back(i);
		S[B[i]].push_back(i);
	}
	while(1){
		if(find(vis,vis+n-1,-1)==vis+n-1) break;
		for(int o:{0,1,2}) st[o].clear();
		make(0,0);
		int mx=0;for(int o:{0,1,2}) if(st[o].size()>st[mx].size()) mx=o;
		vector<int> x(n-1),y(n);
		for(int i:st[mx]) y[i]=1;
		for(int i=0;i<n-1;i++)if(~vis[i]){
			if(y[X[i]]) x[i]=vis[i]^1;
			if(y[Y[i]]) x[i]=vis[i];
		}
		vector<int> z=Query(x,y);
		gdb(1);
		for(int i:st[mx]){
			if(z[i]){
				for(int j:S[i]) if(vis[j]==-1) vis[j]=(i==X[j]),gdb(j);
			}else{
				int flag=0;
				for(int j:S[i]) if(int v=i^X[j]^Y[j];vis[j]==-1&&z[v]){ vis[j]=(i==Y[j]),gdb(j);flag=1;break;}
				if(i==10){
					gdb(i);
					for(int j:S[i]){
						int v=i^X[j]^Y[j];
						gdb(vis[j],z[v],X[j],Y[j],x[j]);
					}
				}
				assert(flag);
			}
		}
	}
	for(int i=0;i<n-1;i++) gdb(vis[i]);
	Answer({vis,vis+n-1});
}