// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

struct C{
  ll k;
  int d;
  ll l;
  C(ll k, int d, ll l): k(k), d(d), l(l){}
  C(){}
};

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<C> vec(n);
  rep(i, n){
    ll k;
    int d;
    ll l;
    cin >> k >> l >> d;
    vec[i] = C(k, d, l);
  }
  ll ld = -1, rd = 1e18;
  while(rd - ld > 1){
    ll md = (rd + ld) / 2;
    ll sum = 0;
    for(int i = 0; i < n; i++){
      if(vec[i].l + (vec[i].k - 1) * (1LL << vec[i].d) <= md)sum += vec[i].k;
      else if(vec[i].l > md)sum += 0;
      else{
        sum += (md - vec[i].l) / (1LL << vec[i].d) + 1;
      }
    }
    if(sum % 2 == 1)rd = md;
    else ld = md;
  }
  cout << rd << endl;
	return 0;
}