#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
#include <limits>

using namespace std;

template<class T = int,T divided_by = 10>
constexpr T PINF(){ return std::numeric_limits<T>::max()/divided_by; }

template<class T = int,T divided_by = 10>
constexpr T MINF(){ return std::numeric_limits<T>::lowest()/divided_by; }

int main() {
    cin.tie(nullptr); ios::sync_with_stdio(false);

    long long n;
    cin >> n;

    set<pair<long long, long long>> black_seg; //first : start pos, second : length

    //lower_boundなどを使うときに-infとinfを追加しておくとせぐふぉしないので便利
    black_seg.insert({PINF<long long>(),PINF<long long>()});
    black_seg.insert({MINF<long long>(),MINF<long long>()});

    vector<long long> ans(n,0); //answers

    for(int i = 0; i < n; ++i){
        long long s,c;
        cin >> s >> c;

        long long ret = s+c-1; //last pos
        long long next_s = s,next_c = c;

        //左方向で重なる（又は隣接する）分をeraseしてnext_sとnext_cを更新
        auto left_it = --black_seg.lower_bound({s,0});
        auto left = *(left_it);
        if(s<=left.first+left.second-1 +1){ //隣接するものもくっつけるため+1
            next_s = left.first;
            next_c += left.second;
            ret = next_s+next_c-1;
            black_seg.erase(left_it);
        }

        //右方向で重なる分をeraseしてnext_cを更新
        auto right_it = black_seg.lower_bound({s,0});
        while(right_it != black_seg.end()){
            auto right = *right_it;
            if(ret<right.first){ break; }
            next_c += right.second;
            ret = next_s+next_c-1;
            right_it = black_seg.erase(right_it);
        }

        //新しいblack_segを追加
        black_seg.insert({next_s,next_c});
        
        ans[i] = ret;
    }
    
    for(int i = 0; i < n; ++i){
        cout << ans[i] << endl;
    }
    return 0;
}

5
1000000000 1000000000
3 1
5 1
4 1
2 2
>>> 1999999999
>>> 3
>>> 5
>>> 4
>>> 6