#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll solve(ll x){
    if(x<=0) return 0;
    if(x%4==1) return 1;
    else if(x%4==3) return 0;
    else if(x%4==2) return (x-1)^(1ll);
    else return x;
}
int main()
{
    int n; cin>>n;
    ll ans=0;
    for(int i=0; i<n; i++){
        ll k, l, d; cin>>k>>l>>d;
        ll l1=l%(1ll<<d);
        if(k%2==1) ans^=l1;
        l>>=d;
        ll t=solve(l-1)^solve(l+k-1);
        t<<=d;
        ans^=t;
    }
    cout<<ans<<endl;
    return 0;
}