#include <fstream>
# include <algorithm>
using namespace std;
struct prop
{
    int s,p,l;
};
prop v[6000001];
int x[6000001];
bool cmp (prop a,prop b)
{
    return b.s<a.s;
}
int main()
{
ifstream fin("buline.in");
ofstream fout("buline.out");
    int i,n,sc,ic,smax,im,sfm,a,b,k,h,ok=0,stot=0,sfmin,imin,smax2=0,smin;
    fin>>n;
    for(i=1;i<=n;i++)
        {
            fin>>a>>b;
            if(b==0)
                x[i]=-a;
             if(b==1)
                x[i]=a;
         stot+=x[i];
        }
sc=smax=x[1];
ic=im=sfm=1;
for(h=2;h<=n;h++)
        {
            if(sc+x[h]<x[h])
            {sc=x[h];
            ic=h;}
        else
            sc=sc+x[h];
        if(sc>smax)
            {
                smax=sc;
                im=ic;
                sfm=h;
            }
        }
sc=smin=x[1];
 sfmin=imin=ic=1;
   for(h=2;h<=n;h++)
        {
            if(sc+x[h]>x[h])
            {sc=x[h];
            ic=h;}
        else
            sc=sc+x[h];
        if(sc<smin)
            {
                smin=sc;
                imin=ic;
                sfmin=h;
            }
        }
smax2=stot-smin;
if(smax>smax2)
{
    fout<<smax<<" "<<im<<" "<<sfm-im+1;
}
else
        fout<<smax2<<" "<<(sfmin+1)%n<<" "<<n-(sfmin-imin+1);

fin.close();
fout.close();
return 0;
}