#include <bits/stdc++.h>
using namespace std;
int n,a[1010];
struct node {
    int to,val;
}e[1010];
int main () {
    freopen("rotation.in","r",stdin);
    freopen("rotation.out","w",stdout);
    cin >> n;
    a[1]=0;
    for (int i=1;i<n;i++) {
        int s,d,c;
        cin >> s >> d >> c;
        e[min(s,d)].to=max(s,d);
        e[min(s,d)].val=c;
    }
    for (int i=1;i<=n;i++) {
        if (e[i].val==0) a[e[i].to]=a[i];
        else {
            if (a[i]==0) a[e[i].to]=1;
            else a[e[i].to]=0;
        } 
    }
    cout << a[n] <<endl;
    return 0;
}