#include <bits/stdc++.h>
            
using namespace std;

typedef long long ll;

int n; 
struct node
{
    vector<int> nxt;
    vector<bool> p;
    bool f;
};
vector<node> v(1005);

inline void dfs(int step, bool flag)
{
    v[step].f = flag;
    for(int i = 0; i < v[step].nxt.size(); ++i)
        dfs(v[step].nxt[i],flag^v[step].p[i]);
}
    
int main()
{
    freopen("rotation.in", "r", stdin);
    freopen("rotation.out", "w", stdout);
        
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
            
    cin >> n;
    for(int i = 1; i < n; ++i)
    {
        int a, b;
        bool c;
        cin >> a >> b >> c;
        v[a].nxt.push_back(b);
        v[a].p.push_back(c);
    }
    
    dfs(1,0);
    
    cout << v[n].f;
    
   	return 0;
}