#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,ok,st,dr,cul,poz,min0,max0;

    scanf("%d",&n);
    for(i=1,ok=0; i<=n; a[i]+=a[i-1],++i){
        scanf("%d%d",&a[i],&cul);
        if(!cul)
            a[i]*=-1;}
    for(i=1; i<=n; a[i++]*=-1);
    for(i=1,min0=poz=0,max0=INF; i<=n; ++i){
        if(a[i]-min0>max0){
            max0=a[i]-min0;
            st=poz+1;
            dr=i;}
        if(a[i]<min0){
            min0=a[i];
            poz=i;}}
    printf("%d 1 1",max0-a[n]);}

int main(){

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