#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;
    fin>>n;
    for(i=1;i<=n;i++)
        {
            fin>>a>>b;
            if(b==0)
                x[i]=-a;
             if(b==1)
                x[i]=a;
        }
x[0]=x[n];
i=1;
while(i<=n)
{
k=i;
sc=smax=x[i];
ic=im=sfm=k;
for(h=i+1;h<=i+4;h++)
        {
            if(sc+x[h%n]<x[h%n])
            {sc=x[h%n];
            ic=h%n;}
        else
            sc=sc+x[h%n];
        if(sc>smax)
            {
                smax=sc;
                im=ic;
                sfm=h%n;
            }
        }
if(sfm==0)
    sfm=5;
v[i].s=smax;
v[i].p=im;
v[i].l=2*n-sfm-im+1;
if(im-sfm==1 || im-sfm==-1)
{
    v[i].l=2;
}
i++;
}
sort(v+1,v+n+1,cmp);
for(i=2;i<=n;i++)
{
    if(v[i].s==v[1].s)
    {
        if(v[i].p<=v[1].p)
        {
            fout<<v[i].s<<" "<<v[i].p<<" "<<v[i].l;
            break;
        }
        else
            if(v[i].l<v[1].l)
            {
                fout<<v[i].s<<" "<<v[i].p<<" "<<v[i].l;
                break;
            }

    }
    else ok++;
}
if(ok==n-1)
    fout<<v[i].s<<" "<<v[i].p<<" "<<v[i].l;
fin.close();
fout.close();
return 0;
}