#include<algorithm>
using namespace std;

#define DIM 200001
#define INF -1000001

int n,a[DIM];

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

	scanf("%d",&n);
	for(i=1; i<=n; a[i]+=a[i-1],++i){
		scanf("%d%d",&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("%d ",a[n]-smin);
    if(dr==n)
        printf("1 %d",n-dr+st-1);
    else
        printf("%d %d",dr+1,n-dr+st-1);}

int main(){

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