#include <iostream>
#include <cstdio>

using namespace std;

typedef long long ll;
const int N = 200000 + 7;
int n;
ll s[2 * N];
int d[2 * N], l = 1, r = 0; /// deque

void ins(int i) {
  while (l <= r && s[i] >= s[d[r]]) {
    r--;
  }
  d[++r] = i;
}

void pop(int i) {
  if (l <= r && s[d[l]] == i) {
    l++;
  }
}


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

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

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

  ll best = -(1LL << 60);
  int start, len;

  for (int i = 2 * n; i > n; i--) {
    ins(i);
  }

  for (int i = n; i >= 1; i--) {
    ins(i);
    pop(i + n);
    ll cur = s[d[l]] - s[i - 1];
    if (cur >= best) {
      best = cur;
      start = i;
      len = d[l] - i + 1;
    }
  }


  printf("%lld %d %d\n", best, start, len);


  return 0;
}