#include<iostream>
#include<algorithm>
using namespace std;
int N;
long K[3<<17],L[3<<17],D[3<<17];
bool cnt(long X)
{
	long ret=0;
	for(int i=0;i<N;i++)
	{
		if(X<L[i])continue;
		long r=X-L[i]>>D[i];
		ret=(ret+min(r+1,K[i]))%2;
	}
	return ret%2==1;
}
main()
{
	cin>>N;
	for(int i=0;i<N;i++)cin>>K[i]>>L[i]>>D[i];
	long L=-1,R=2e18;
	while(R-L>1)
	{
		long M=(L+R)/2;
		if(cnt(M))R=M;
		else L=M;
	}
	cout<<R<<endl;
}