#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>b[1010],c[1010];
int n,f[1010],a1,a2,a3;
bool bk[1010];
void dfs(int p){
    bk[p]=1;
	if(b[p].size())for(int i=0;i<b[p].size();i++)
	    if(!bk[b[p][i]])
			f[b[p][i]]=(f[p]+c[p][i])%2,dfs(b[p][i]);
	return;
}
int main(){
	freopen("rotation.in","r",stdin);
	freopen("rotation.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<n;i++){
	    scanf("%d%d%d",&a1,&a2,&a3);
		b[a1].push_back(a2);
		c[a1].push_back(a3);
	}
	dfs(1);
	printf("%d",f[n]);
	return 0;
}