#include<bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
int n , a; bool vis[N];
struct node {
	int to , nex;
}e[N]; int cnt , h[N] , col[N];
void add(int u , int v) {
	e[++ cnt] = (node){v , h[u]}; h[u] = cnt;
}
void dfs(int x , int fa) {
	col[x] = -col[fa];
	if(col[x] == 1) a ++;
	for(int i = h[x];i;i = e[i].nex) {
		if(e[i].to == fa) continue;
		dfs(e[i].to , x);
		vis[x] = 0;
	}
}

int main() {
	cin >> n;
	for(int i = 1 , u , v;i < 2 * n;i ++) {
		scanf("%d%d",&u,&v);
		add(u , v); add(v , u);
	}
	for(int i = 1;i <= 2 * n;i ++) vis[i] = 1;
	col[0] = 1; dfs(1 , 0);
//	cout << n << endl;
	for(int i = 1;i <= 2 * n;i ++) {
		if(vis[i]) {
			if(a > n && (col[i] == 1)) col[i] = -1 , a --;
			if(a < n && (col[i] == -1)) col[i] = 1 , a ++;
		}
		printf("%d ",col[i]);
	}
	return 0;
}
/*
3 1 2 2 3 2 4 4 5 4 6
*/