#include <cstdio>
#include <algorithm>
#include <set>
#include <cctype>
using namespace std;
int n;

set < int > S [ 2 ];
int a,b;
int read_int() {
    char c;
    int sum;

    while ( !isdigit ( c = getchar() ) );
    sum = c - '0';

    while ( isdigit ( c = getchar() ) ) {
        sum *= 10;
        sum += c - '0';
    }
    return sum;
}
int solve () {
    int sol = 0;
    set < int >::iterator it = S [ 0 ].begin();
    set < int >::iterator it1 = S [ 1 ].end();
    --it1;
    for ( ; it != S [ 0 ].end() ; it++) {
        sol = max ( sol , *it + *it1 );
        --it1;
    }
    return sol;
}
int main ( ) {
    scanf("%d",&n);
    for ( int i = 0 ; i < n ; i++) {
        a = read_int();
        b = read_int();
        S [ 0 ].insert ( a );
        S [ 1 ].insert ( b );
        printf("%d\n",solve());
    }
    return 0;
}