#include<stdio.h>
#include<deque>
using namespace std;
deque<int> q;
long long sp[400005];
int main()
{
    freopen("buline.in","r",stdin);
    freopen("buline.out","w",stdout);
    int n,i,tip,start,length;long long x,sol=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%lld%d",&x,&tip);
        if(tip==1)
            sp[i]=sp[i-1]+x;
        else sp[i]=sp[i-1]-x;
    }
    for(i=1;i<n;i++)
        sp[i+n]=sp[i+n-1]+sp[i]-sp[i-1];
    for(i=1;i<2*n;i++)
    {
        if(!q.empty() && i-q.front()==n) q.pop_front();
        while(!q.empty() && sp[q.back()]>sp[i]) q.pop_back();
        q.push_back(i);
        if(sp[i]-sp[q.front()]>sol)
        {
            sol=sp[i]-sp[q.front()];
            start=q.front()+1;
            length=i-start+1;
        }
    }
    printf("%lld %d %d\n",sol,start,length);
    return 0;
}