#include <iostream>
#include <cctype>
#include <cstdio>
#include <map>
#include <queue>

using namespace std;

__attribute__((always_inline)) void read(int &num) {
  static char inBuffer[0x30D40];

  static unsigned int p = 0x30D3F;
  num = 0x0;

  while(inBuffer[p] < 0x30 | inBuffer[p] > 0x39) {
    ++p != 0x30D40 || (fread(inBuffer, 0x1, 0x30D40, stdin), p = 0x0);
  }

  while(inBuffer[p] > 0x2F & inBuffer[p] < 0x3A) {
    num = num * 0xA + inBuffer[p] - 0x30;

    ++p != 0x30D40 || (fread(inBuffer, 0x1, 0x30D40, stdin), p = 0x0);
  }
}


typedef long long ll;
const int N = 200000 + 7;
int n;
ll sum[2 * N];

priority_queue <pair <ll, int>> pq;
map <pair <ll, int>, bool> del;

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

  read(n);
  for (int i = 1; i <= n; i++) {
    int x, y;
    read(x);
    read(y);
    if (y == 0) {
      sum[i] = -x;
    } else {
      sum[i] = +x;
    }
    sum[i + n] = sum[i];
  }

  for (int i = 1; i <= 2 * n; i++) {
    sum[i] += sum[i - 1];
  }

  for (int i = 0; i < n; i++) {
    pq.push({sum[i], -i});
  }

  ll best = -(1LL << 60);
  int start, len;
  for (int i = 1; i <= n; i++) {
    pq.push({sum[i + n - 1], -(i + n - 1)});
    while (del[pq.top()]) {
      pq.pop();
    }
    pair <ll, int> it = pq.top();
    ll cur = it.first - sum[i - 1];
    if (cur > best) {
      best = cur;
      start = i;
      len = -it.second - i + 1;
    }
    del[ {sum[i - 1], -(i - 1)}] = 1;
  }

  cout << best << ' ' << start << ' ' << len << '\n';

  return 0;
}