#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int Mn = 2e5 + 6;
const int oo = 2e9 + 10;

int n, id, len, sum, ans, last, mn, cnt;
int ar[Mn];

int main()
{
    freopen("buline.in", "r", stdin);
    freopen("buline.out", "w", stdout);

    ans = -oo;
    mn = oo;
    last = 1;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        int b;
        scanf("%d %d", &ar[i], &b);
        if (b == 0)
           ar[i] = -ar[i];

        sum += ar[i];
    }

    for (int i = 1; i <= n; i++)
    {
        cnt += ar[i];
        if (cnt > ar[i])
           cnt = ar[i], last = i;

        if (sum - cnt > ans)
           ans = sum - cnt, id = i + 1, len = n - i + last - 1;

        if (id == n + 1)
           id = 1;
    }

    cnt = 0;
    for (int i = 1; i <= n; i++)
    {
        cnt += ar[i];
        if (cnt < ar[i])
           cnt = ar[i], last = i;

        if (cnt > ans)
           ans = cnt, id = last, len = i - last + 1;
    }

    printf("%d %d %d\n", ans, id, len);

  return 0;
}