#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

int main(){
	
	int N;
	cin>>N;
	
	vector<long long> K(N),L(N),D(N);
	rep(i,N){
		scanf("%lld %lld %lld",&K[i],&L[i],&D[i]);
	}
	
	long long ok = 1000000000000000000,ng = -1;
	
	while(ok-ng>1){
		long long mid = (ok+ng)/2;
		
		int sum = 0;
		
		rep(i,N){
			if(mid<L[i])continue;
			long long temp = mid-L[i];
			long long x = min(K[i],temp / (1LL<<D[i]) + 1);
			sum ^= x&1;
		}
		
		if(sum)ok = mid;
		else ng = mid;
		
	}
	
	cout<<ok<<endl;
	
	return 0;
}