#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std ;

int n, a [ 100100 ], b [ 100100 ], perm [ 100100 ], apmin, tre, pom = -1 ;

int main ( void ) {
    scanf ( "%d", &n ) ;
    for ( int i = 0 ; i < n ; ++i ) {
        scanf ( "%d%d", &a [ i ], &b [ i ] ) ;
        perm [ i ] = i ;
        pom = max ( pom, a [ i ] + b [ i ] ) ;
        apmin = 2000000000 ;
        if ( i > 0 ) {
            do {
                tre = -1 ;
                for ( int j = 0 ; j < i ; ++j )
                    tre = max ( a [ perm [ j ] ] + b [ perm [ j + 1 ] ], tre ) ;
                tre = max ( tre, a [ perm [ i ] ] + b [ perm [ 0 ] ] ) ;
                apmin = min ( apmin, tre ) ;
            } while ( next_permutation ( perm, perm + i + 1 ) ) ;
            printf ( "%d\n", min ( apmin, pom ) ) ;
        } else
            printf ( "%d\n", a [ i ] + b [ i ] ) ;

    }
    return 0 ;
}