#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <cstring>

using namespace std;

long long f(long long n) {
  n++;
  long long res = 0;
  for (long long k = n / 4 * 4; k < n; k++) {
    res ^= k;
  }
  return res;
}

int main() {
  int N;
  cin >> N;
  long long ans = 0;
  for (int i = 0; i < N; i++) {
    long long K, L, D;
    cin >> K >> L >> D;
    if (K % 2 == 1) {
      ans ^= L & (1LL << D) - 1;
    }
    L >>= D;
    ans ^= (f(L + (K - 1)) ^ f(L - 1)) << D;
  }
  cout << ans << endl;
}