//
//  B.cpp
//
//  Created by Vlad Turcuman on 15/12/2017.
//  Copyright © 2017 Vlad Turcuman. All rights reserved.
//

#include <algorithm>
//#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
#include <cmath>
#include <map>

#define pii pair<int,int>
#define fs first
#define sc second
#define NMax 300001

using namespace std;
ifstream cin("buline.in");
ofstream cout("buline.out");
int n,Max,L,x,Sf;

int a[NMax* 2];
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i]>>x;
        a[i] *= x ? 1 : -1;
        a[i+n] = a[i];
    }
    
    int sum=a[1];
    int lg = 1;
    
    for(int i=2;i<=n*2;i++){
        sum += a[i];
        lg++;
        if(lg == n) break;
        if(sum > Max)
        {
            L = lg,
            Max = sum,
            Sf = i;
        }
        
        if(sum <= 0)
            lg = 0, sum = 0;
    }
    cout<<Max << ' '<<Sf - L +1<< ' '<<L<<'\n';
    return 0;
    
}