#include<bits/stdc++.h>
#define int long long
const int N = 1e5+10;
using namespace std;
int read() {
	int x=0;short f=1;char s=getchar();
	while(s<48||s>57){f=s=='-'?-1:1;s=getchar();}
	while(s>=48&&s<=57){x=x*10+s-48;s=getchar();}
	return x*f;
}
vector<int>e[N],k;
int n,tot,co[N];
void dfs(int x,int f,int c) {
    if(e[x].size()==1) return ;
    co[x]=c;
    tot+=c;
    for(auto v:e[x]) {
        if(v==f) continue;
        dfs(v,x,c*-1);
    }
}
signed main() {
	cin>>n;
	n*=2;
	for(int i=1,a,b;i<n;i++) {
		cin>>a>>b;
		e[a].push_back(b);
		e[b].push_back(a);
	}
	int opt=1;
	for(int i=1;i<=n;i++) {
		if(e[i].size()==1) {
			k.push_back(i);
		}
		else opt=i;
	}
	dfs(opt,opt,1);
	for(auto v:k) {
		if(tot>=0) {
            tot--;
            co[v]=-1;
        }
        else {
            tot++;
            co[v]=1;
        }
	}
	for(int i=1;i<=n;++i) cout<<co[i]<<" ";
	return 0;
}