n = int(input())
total_xor = 0

def compute_xor(n):
    mod = n % 4
    if mod == 0:
        return n
    elif mod == 1:
        return 1
    elif mod == 2:
        return n + 1
    else:
        return 0

for _ in range(n):
    k, l, d = map(int, input().split())
    s = 1 << d
    q = l // s
    r = l % s
    start = q
    end = q + k - 1
    xor_q = compute_xor(end) ^ compute_xor(start - 1)
    upper = xor_q << d
    lower = r if k % 2 else 0
    total_xor ^= (upper ^ lower)

print(total_xor)