#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
long long v[200005];
pair<long long ,long long> t[200005];
int main()
{
	FILE *in,*out;
	long long n,i,x,y;
	pair<long long ,pair<long long,long long> > rez=mp(-(1<<30),mp(0,0));
	in=fopen("buline.in","r");
	out=fopen("buline.out","w");
	fscanf(in,"%lld%lld%lld",&n,&x,&y);
	x=y?x:-x;
	v[1]=x;
	t[1]=mp(0,0);
	rez=mp(x,mp(1,1));
	FOR(i,2,n)
	{
		fscanf(in,"%lld%lld",&x,&y);
		x=y?x:-x;
		v[i]=v[i-1]+x;
		if (v[i]>t[i-1].max)
			t[i]=mp(v[i],i);
		else
			t[i]=t[i-1];
		if (rez.fs<v[i]||(rez.fs==v[i]&&rez.ss>=mp((long long)1,i)))
			rez=mp(v[i],mp(1,i));
	}
	//printf("%d\n",rez);
	FOR(i,1,n)
	{
		if (rez.fs<t[i-1].fs+v[n]-v[i-1]||(rez.fs==t[i-1].fs+v[n]-v[i-1]&&rez.ss>=mp(i,n-i+1+t[i-1].ss)))
			rez=mp(t[i-1].fs+v[n]-v[i-1],mp(i,n-i+1+t[i-1].ss));
	}
	fprintf(out,"%lld %lld %lld\n",rez.fs,rez.ss.fs,rez.ss.ss);
	fclose(in);
	fclose(out);
	return 0;
}