//#include<algorithm>
//using namespace std;
#include<stdio.h>

#define DIM 500001
#define INF -10001

long long n,a[DIM];

void solve(){
	long long i,st,dr,cul,poz,smin,max0;

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

int main(){

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