Problem: We have a tree with N vertices numbered 1 to N. The i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i. Your objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:

* For any two vertices painted in the same color, the distance between them is an even number.



Find a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.

Constraints

* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq u_i < v_i \leq N
* 1 \leq w_i \leq 10^9

Input

Input is given from Standard Input in the following format:


N
u_1 v_1 w_1
u_2 v_2 w_2
.
.
.
u_{N - 1} v_{N - 1} w_{N - 1}


Output

Print a coloring of the vertices that satisfies the condition, in N lines. The i-th line should contain `0` if Vertex i is painted white and `1` if it is painted black.

If there are multiple colorings that satisfy the condition, any of them will be accepted.

Examples

Input

3
1 2 2
2 3 1


Output

0
0
1


Input

5
2 5 2
2 3 10
1 3 8
3 4 2


Output

1
0
1
0
1

Solution (in PYTHON):

Solution:
#coding:utf-8
from collections import defaultdict
import sys
from Queue import Queue
N=input()
U=[];V=[];W=[]
G=defaultdict(list)
Dist={}
for _ in range(N-1):
    u,v,w=map(int,raw_input().split())
    u,v=min(u,v),max(u,v)
    U.append(u);V.append(v);W.append(w)    
    G[u].append(v)
    G[v].append(u)
    Dist[(u,v)]=Dist[(v,u)]=w

vis=[False]*(10**5+1)
color=[None]*(10**5+1)
q=Queue()
vis[1]=True
color[1]=0
curCol=1
for u in G[1]:q.put(u)
while not q.empty():
    child=q.get()
    vis[child]=True
    par=None
    for n in G[child]:
        if vis[n]: 
            par=n;break
    dist=Dist[(par,child)]
    if dist%2==0: color[child]=color[par]
    else: color[child]=color[par]^1
    for ch in G[child]:
        if not vis[ch]: q.put(ch)

for c in color[1:N+1]:print(c)