#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
int v[200005];
pair<int,int> t[200005];
int main()
{
	FILE *in,*out;
	int n,i,x,y;
	pair<int,pair<int,int> > rez=mp(-(1<<30),mp(0,0));
	in=fopen("buline.in","r");
	out=fopen("buline.out","w");
	fscanf(in,"%d%d%d",&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,"%d%d",&x,&y);
		x=y?x:-x;
		v[i]=v[i-1]+x;
		t[i]=max(t[i-1],mp(v[i-1],i-1));	
		rez=max(rez,mp(v[i],mp(1,i)));
	}
	FOR(i,1,n)
		rez=max(rez,mp(t[i].fs+v[n]-v[i-1],mp(i,n-i+1+t[i].ss)));
	fprintf(out,"%d %d %d\n",rez.fs,rez.ss.fs,rez.ss.ss);
	fclose(in);
	fclose(out);
	return 0;
}