#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <deque>
//#define x first
//#define y second
using namespace std;
ifstream fin("buline.in");
ofstream fout("buline.out");
deque <int> maxi,mini;
long long int v[401000],i,j,n,m;
long long int total,a,b,ls,ld,x,y;
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>a>>b;
        if(b)
            v[i]=v[i-1]+a;
        else
            v[i]=v[i-1]-a;
    }
    total=v[1];
    x=1;
    y=1;
    for(i=n+1;i<=2*n;i++)
        v[i]=v[i-n]+v[n];
    for(i=1;i<=2*n;i++)
    {
        while(maxi.size() && maxi.front()<=i-n)
            maxi.pop_front();
        while(mini.size() && mini.front()<=i-n)
            mini.pop_front();
        while(maxi.size() && v[maxi.back()]<v[i])
            maxi.pop_back();
        while(mini.size() && v[mini.back()]>v[i])
            mini.pop_back();
        maxi.push_back(i);
        mini.push_back(i);
        if(v[maxi.front()]-v[mini.front()]==total&& min(maxi.front(),mini.front())==x)
        {
            y=max(maxi.front(),mini.front());
        }
        if(v[maxi.front()]-v[mini.front()]>total)
        {
            total=v[maxi.front()]-v[mini.front()];
            x=min(maxi.front(),mini.front());
            y=max(maxi.front(),mini.front());

        }
    }
    x++;
    if(x > n)
        x-=n;
    if(y-x+1 > n)
        y-=n;
    fout<<total<<" "<<x<<" "<<y-x+1;
return 0;
}