#include<cstdio>
#include<iostream>
#include<map>
#include<queue>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<stack>
using namespace std;
struct ss{
	int x,y,k;
};
ss a[1001];
int f[1001];
int main(){
    freopen("rotation.in","r",stdin);
	freopen("rotation.out","w",stdout);
	int n,st;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y>>a[i].k;
		if(a[i].x=1){
			st=i;
		}
	}
	ss q=a[st];
	a[st]=a[1],a[1]=q;
	for(int i=2;i<=n;i++){
		for(int j=i;j<=n;j++){
			if(a[j].x==a[i-1].y){
				q=a[j],a[j]=a[i],a[i]=q;
				break;
			}
		}
	}
	for(int i=1;i<=n;i++){
		if(a[i].k){
			f[a[i].y]=!f[a[i].x];
		}else{
			f[a[i].y]=f[a[i].x];
		}
	}
	cout<<f[n];
	return 0;
}