#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
struct connect{
    int s,d,c;
}a[1010];
int n,ans[1010];
queue<int> q;
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",&a[i].s,&a[i].d,&a[i].c);
    }
    ans[1]=0;
    for(int i=2;i<=n;i++)
    {
        ans[i]=-1;
    }
    q.push(1);
    while(q.size())
    {
        int x=q.front();
        q.pop();
        for(int i=1;i<n;i++)
        {
            if(a[i].s==x)
            {
                if(a[i].c==0) ans[a[i].d]=ans[x];
                else ans[a[i].d]=1-ans[x];
                q.push(a[i].d);
            }
        }
    }
    printf("%d",ans[n]);
    return 0;
}