#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int Bisect_Int(long long ok, long long ng, const function<bool(long long)>& is_ok) {
    while (abs(ok - ng) > 1) {
        long long mid = (ok + ng) / 2;
        if (is_ok(mid)) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    return ok;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int N;
    cin >> N;
    vector<long long> K(N), L(N), D(N);
    for (int i = 0; i < N; ++i) {
        cin >> K[i] >> L[i] >> D[i];
    }
    
    auto is_ok = [&](long long ans) {
        vector<int> where;
        for (int i = 0; i < N; ++i) {
            if (ans >= L[i]) {
                where.push_back(i);
            }
        }
        int sum = 0;
        for (int idx : where) {
            sum += min(K[idx], ((ans - L[idx]) >> D[idx]) + 1) % 2;
        }
        return sum % 2;
    };
    
    long long ans = Bisect_Int(1LL << 60, -1LL, is_ok);
    cout << ans << endl;
    
    return 0;
}