#include<algorithm>
using namespace std;

#define DIM 200001
#define INF -1000001

int n,a[2*DIM];

void print(){
    int i;

    for(i=1; i<=n; ++i)
        printf("%d ",a[i]);}

void solve(){
    int i,s,cul,smax;

    scanf("%d",&n);
    for(i=1; i<=n; ++i){
        scanf("%d%d",&a[i],&cul);
        if(!cul)
            a[i]*=-1;}
    for(i=1; i<=n; a[i++]*=-1);
    for(i=1,s=smax=0; i<=n; ++i){
        s=max(s+a[i],a[i]);
        smax=max(smax,s);}
    for(i=1,s=0; i<=n; ++i)
        s+=-a[i];
    printf("%d 0 0",s+smax);}

int main(){

    freopen("buline.in","r",stdin);
    freopen("buline.out","w",stdout);
    solve();
    return 0;}