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

using namespace std;

const int Mn = 4e5 + 6;
const long long oo = 3e9;

int n, id, len;
int ar[Mn];
long long ans = -oo;

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

    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        int t;
        scanf("%d %d", &ar[i], &t);
        if (t == 0)
           ar[i] = -ar[i];
    }

    for (int i = 1; i <= n; i++)
        ar[i + n] = ar[i];

    long long sum = 0, st = 1;
    for (int i = 1; i <= 2 * n; i++)
    {
        if (i - st + 1 > n)
           break;

        sum += ar[i];
        if (sum > ans)
           ans = sum, id = st, len = i - st + 1;

        if (sum < 0)
           st = i + 1, sum = 0;
    }

    printf("%lld %d %d", ans, id, len);

  return 0;
}