#include <fstream>

using namespace std;

ifstream in("buline.in");
ofstream out("buline.out");

const int sizee = 200000;
int n, val, type, v[sizee + 2];
int totalsum;
int smax = -(1 << 30);

struct komp{ int maxi, st, dr; };

komp summax(){
    komp bestt = {-(1 << 30), 0, 0};
    int summy = 0, __leftt = 1;
    for(int i = 1; i <= n; i++){
        summy += v[i];
        if(summy < 0){
            summy = 0;
            __leftt = i + 1;
        }
        if(summy > bestt.maxi){
            bestt.maxi = summy;
            bestt.st = __leftt;
            bestt.dr = i;
        }
    }

    for(int i = 1; i <= n; i++)
        v[i] *= (-1);

    return bestt;
}

int main(){
    in>>n;
    for(int i = 1; i <= n; i++){
        in>>val>>type; val *= (type ? 1 : -1);
        v[i] = val; totalsum += v[i];
    }

    komp p = summax(), m = summax();

    if(p.maxi >= totalsum + m.maxi){
        out<<p.maxi<<" "<<p.st<<" "<<(p.dr - p.st + 1)<<"\n";
    }else{
        out<<totalsum + m.maxi<<" "<<((m.dr == n) ? 1 : m.dr + 1)<<" "<<n - (m.dr - m.st + 1)<<"\n";
    }

    return 0;
}