#include <vector>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <unordered_map>
using namespace std;
template<class T> inline bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }

using ll = long long;
ll K[303030], L[303030], D[303030];
ll two[100];
int n;

bool F(ll x) {
    ll cnt = 0;
    for (int i=0; i<n; ++i) {
        if (x < L[i]) continue;
        cnt += min(K[i], 1 + (x-L[i])/two[D[i]]);
    }
    return cnt%2;
}

int main() {
    two[0] = 1;
    for (int i=1; i<60; ++i) two[i] = two[i-1]*2;

    cin >> n;
    for (int i=0; i<n; ++i) {
        cin >> K[i] >> L[i] >> D[i];
    }

    ll l=-1, r=1e18;
    while (r-l>1) {
        ll m = (r+l)/2;
        if (F(m)) r = m;
        else l = m;
    }
    cout << r << endl;
}